Functional and Logic Programming : 10th International Symposium, FLOPS 2010, Sendai, Japan, April 19-21, 2010, Proceedings

by Blume, Matthias; Kobayashi, Naoki; Vidal, German

• ISBN13: 9783642122507
• ISBN10: 3642122507
• Format: Paperback
• Copyright: 2010-05-21
• Publisher: Springer-Verlag New York Inc

Summary

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.

Table of Contents

Invited Talks
Beluga: Programming with Dependent Types, Contextual Data, and Contexts	p. 1
Using Static Analysis to Detect Type Errors and Concurrency Defects in Erlang Programs	p. 13
Solving Constraint Satisfaction Problems with SAT Technology	p. 19
Refereed Papers
Types
A Church-Style Intermediate Language for MLF	p. 24
II¿Dependent Types without the Sugar	p. 40
Haskell Type Constraints Unleashed	p. 56
Program Analysis and Transformation
A Functional Framework for Result Checking	p. 72
Tag-Free Combinatory for Binding-Time Polymorphic Program Generation	p. 87
Code Generation via Higher-Order Rewrite Systems	p. 103
Foundations
A Complete Axiomatization of Strict Equality	p. 118
Standardization and Böhm Trees for ¿¿-Calculus	p. 134
An Integrated Distance for Atoms	p. 150
Logic Programming
A Pearl on SAT Solving in Prolog	p. 165
Automatically Generating Counterexamples to Naive Free Theorems	p. 175
Applying Constraint Logic Programming to SQL Test Case Generation	p. 191
Evaluation and Normalization
Internal Normalization, Compilation and Decompilation for System Fß¿	p. 207
Towards Normalization by Evaluation for the ß¿-Calculus of Constructions	p. 224
Defunctionalized Interpreters for Call-by-Need Evaluation	p. 240
Term Rewriting
Complexity Analysis by Graph Rewriting	p. 257
Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and ¿-Calculus	p. 272
Proving Injectivity of Functions via Program Inversion in Term Rewriting	p. 288
Parallelism and Control
Delimited Control in OCaml, Abstractly and Concretely: System Description	p. 304
Automatic Parallelization of Recursive Functions Using Quantifier Elimination	p. 321
A Skeleton for Distributed Work Pools in Eden	p. 337
Author Index	p. 355
Table of Contents provided by Ingram. All Rights Reserved.