×

zbMATH — the first resource for mathematics

Functional and logic programming. 10th international symposium, FLOPS 2010, Sendai, Japan, April 19–21, 2010. Proceedings. (English) Zbl 1186.68003
Lecture Notes in Computer Science 6009. Berlin: Springer (ISBN 978-3-642-12250-7/pbk). xi, 355 p. (2010).

Show indexed articles as search result.

The articles of this volume will be reviewed individually. The preceding symposium has been reviewed (see Zbl 1133.68006).
Indexed articles:
Rémy, Didier; Yakobowski, Boris, A church-style intermediate language for ML\(^{\text{F}}\), 24-39 [Zbl 1284.68136]
Altenkirch, Thorsten; Danielsson, Nils Anders; Löh, Andres; Oury, Nicolas, \(\Pi \Sigma \): dependent types without the sugar, 40-55 [Zbl 1284.68122]
Orchard, Dominic; Schrijvers, Tom, Haskell type constraints unleashed, 56-71 [Zbl 1284.68135]
Barthe, Gilles; Buiras, Pablo; Kunz, César, A functional framework for result checking, 72-86 [Zbl 1284.68123]
Thiemann, Peter; Sulzmann, Martin, Tag-free combinators for binding-time polymorphic program generation, 87-102 [Zbl 1284.68138]
Haftmann, Florian; Nipkow, Tobias, Code generation via higher-order rewrite systems, 103-117 [Zbl 1284.68131]
Álvez, Javier; López-Fraguas, Francisco J., A complete axiomatization of strict equality, 118-133 [Zbl 1284.68160]
Saurin, Alexis, Standardization and Böhm trees for \(\Lambda \mu \)-calculus, 134-149 [Zbl 1284.68137]
Estruch, Vicent; Ferri, César; Hernández-Orallo, José; Ramírez-Quintana, M. José, An integrated distance for atoms, 150-164 [Zbl 1284.03205]
Howe, Jacob M.; King, Andy, A pearl on SAT solving in Prolog, 165-174 [Zbl 1284.68115]
Seidel, Daniel; Voigtländer, Janis, Automatically generating counterexamples to naive free theorems, 175-190 [Zbl 1284.68200]
Caballero, Rafael; García-Ruiz, Yolanda; Sáenz-Pérez, Fernando, Applying constraint logic programming to SQL test case generation, 191-206 [Zbl 1284.68113]
Berardi, Stefano; Tatsuta, Makoto, Internal normalization, compilation and decompilation for System \({\mathcal F}_{\beta\eta}\), 207-223 [Zbl 1284.68124]
Abel, Andreas, Towards normalization by evaluation for the \(\beta \eta \)-calculus of constructions, 224-239 [Zbl 1284.68120]
Danvy, Olivier; Millikin, Kevin; Munk, Johan; Zerny, Ian, Defunctionalized interpreters for call-by-need evaluation, 240-256 [Zbl 1284.68129]
Avanzini, Martin; Moser, Georg, Complexity analysis by graph rewriting, 257-271 [Zbl 1284.68315]
Ketema, Jeroen; Simonsen, Jakob Grue, Least upper bounds on the size of Church-Rosser diagrams in term rewriting and \(\lambda \)-calculus, 272-287 [Zbl 1284.68327]
Nishida, Naoki; Sakai, Masahiko, Proving injectivity of functions via program inversion in term rewriting, 288-303 [Zbl 1284.68331]
Morihata, Akimasa; Matsuzaki, Kiminori, Automatic parallelization of recursive functions using quantifier elimination, 321-336 [Zbl 1284.68191]

MSC:
68-06 Proceedings, conferences, collections, etc. pertaining to computer science
68N17 Logic programming
68N18 Functional programming and lambda calculus
00B25 Proceedings of conferences of miscellaneous specific interest
PDF BibTeX XML Cite
Full Text: DOI