This volume contains the proceedings of the 10th International Symposium on Functional and LogicProgramming(FLOPS 2010),held in Sendai, Japan, April 19-21, 2010 at Aoba Memorial Hall, Tohoku University. FLOPS is a forum for research on all issues concerning declarative progr- ming, including functional programming and logic programming, and aims to promotecross-fertilizationand integrationbetween the two paradigms.The p- vious FLOPS meetings were held in Fuji Susono (1995), Shonan Village (1996), Kyoto (1998), Tsukuba (1999), Tokyo (2001), Aizu (2002), Nara (2004), Fuji Susono (2006), and Ise (2008). Since its 1999 edition, FLOPS proceedings have been published by Springer in its Lecture Notes in Computer Science series, as volumes 1722, 2024, 2441, 2998, 3945, and 4989, respectively. In response to the call for papers, 49 papers were submitted. Each paper was reviewed by at least three Program Committee members, with the help of expert external reviewers. The Program Committee meeting was conducted electronically, for a period of two weeks, in December 2009. After careful and thoroughdiscussion,theProgramCommitteeselected21papersforpresentation at the conference. In addition to the 21 contributed papers, the symposium included talks by three invited speakers: Brigitte Pientka (McGill University, Canada), Kostis Sagonas (National Technical University of Athens, Greece), and Naoyuki Tamura (Kobe University, Japan).
Reihe
Sprache
Verlagsort
Verlagsgruppe
Illustrationen
46 s/w Abbildungen
XI, 355 p. 46 illus.
Dateigröße
ISBN-13
978-3-642-12251-4 (9783642122514)
DOI
10.1007/978-3-642-12251-4
Schweitzer Klassifikation
Invited Talks.- Beluga: Programming with Dependent Types, Contextual Data, and Contexts.- Using Static Analysis to Detect Type Errors and Concurrency Defects in Erlang Programs.- Solving Constraint Satisfaction Problems with SAT Technology.- Refereed Papers.- A Church-Style Intermediate Language for ML F .- ??: Dependent Types without the Sugar.- Haskell Type Constraints Unleashed.- A Functional Framework for Result Checking.- Tag-Free Combinators for Binding-Time Polymorphic Program Generation.- Code Generation via Higher-Order Rewrite Systems.- A Complete Axiomatization of Strict Equality.- Standardization and Böhm Trees for ??-Calculus.- An Integrated Distance for Atoms.- A Pearl on SAT Solving in Prolog.- Automatically Generating Counterexamples to Naive Free Theorems.- Applying Constraint Logic Programming to SQL Test Case Generation.- Internal Normalization, Compilation and Decompilation for System .- Towards Normalization by Evaluation for the ??-Calculus of Constructions.- Defunctionalized Interpreters for Call-by-Need Evaluation.- Complexity Analysis by Graph Rewriting.- Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and ?-Calculus.- Proving Injectivity of Functions via Program Inversion in Term Rewriting.- Delimited Control in OCaml, Abstractly and Concretely: System Description.- Automatic Parallelization of Recursive Functions Using Quantifier Elimination.- A Skeleton for Distributed Work Pools in Eden.
