This book constitutes the refereed proceedings of the 10th International Symposium on Functional and Logic Programming, FLOPS 2010, held in Sendai, Japan, in April 2010. The 21 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 49 submissions. The papers are organized in topical sections on types; program analysis and transformation; foundations; logic programming; evaluation and normalization; term rewriting; and parallelism and control.
Author(s): Brigitte Pientka (auth.), Matthias Blume, Naoki Kobayashi, Germán Vidal (eds.)
Series: Lecture Notes in Computer Science 6009 : Theoretical Computer Science and General Issues
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2010
Language: English
Pages: 355
Tags: Software Engineering; Logics and Meanings of Programs; Programming Languages, Compilers, Interpreters; Mathematical Logic and Formal Languages; Artificial Intelligence (incl. Robotics); Programming Techniques
Front Matter....Pages -
Beluga: Programming with Dependent Types, Contextual Data, and Contexts....Pages 1-12
Using Static Analysis to Detect Type Errors and Concurrency Defects in Erlang Programs....Pages 13-18
Solving Constraint Satisfaction Problems with SAT Technology....Pages 19-23
A Pearl on SAT Solving in Prolog....Pages 165-174
Automatically Generating Counterexamples to Naive Free Theorems....Pages 175-190
Applying Constraint Logic Programming to SQL Test Case Generation....Pages 191-206
Internal Normalization, Compilation and Decompilation for System ${\mathcal F}_{\beta\eta}$ ....Pages 207-223
Towards Normalization by Evaluation for the βη -Calculus of Constructions....Pages 224-239
Defunctionalized Interpreters for Call-by-Need Evaluation....Pages 240-256
Complexity Analysis by Graph Rewriting....Pages 257-271
Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and λ -Calculus....Pages 272-287
A Church-Style Intermediate Language for ML F ....Pages 24-39
ΠΣ: Dependent Types without the Sugar....Pages 40-55
Haskell Type Constraints Unleashed....Pages 56-71
A Functional Framework for Result Checking....Pages 72-86
Tag-Free Combinators for Binding-Time Polymorphic Program Generation....Pages 87-102
Code Generation via Higher-Order Rewrite Systems....Pages 103-117
A Complete Axiomatization of Strict Equality....Pages 118-133
Standardization and Böhm Trees for Λ μ -Calculus....Pages 134-149
An Integrated Distance for Atoms....Pages 150-164
Proving Injectivity of Functions via Program Inversion in Term Rewriting....Pages 288-303
Delimited Control in OCaml, Abstractly and Concretely: System Description....Pages 304-320
Automatic Parallelization of Recursive Functions Using Quantifier Elimination....Pages 321-336
A Skeleton for Distributed Work Pools in Eden....Pages 337-353
Back Matter....Pages -
