Functional and Logic Programming

by Schrijvers, Tom; Thiemann, Peter

• ISBN13: 9783642298219
• ISBN10: 3642298214
• Format: Paperback
• Copyright: 2012-06-05
• Publisher: Springer-Verlag New York Inc

Summary

This book constitutes the refereed proceedings of the 11th International Symposium on Functional and Logic Programming, FLOPS 2012, held in Kobe, Japan, in May 2012. The 19 research papers and 3 system demonstrations presented in this volume were carefully reviewed and selected from 39 submissions. They deal with declarative programming, including functional programming and logic programming.

Table of Contents

Programming with Boolean Satisfaction (Abstract)	p. 1
Automated Verification of Higher-Order Functional Programs (Abstract)	p. 2
Dependently-Typed Programming in GHC (Abstract)	p. 3
Call-by-Value Solvability, Revisited	p. 4
Compiling a Functional Logic Language: The Basic Scheme	p. 17
Classical Call-by-Need Sequent Calculi: The Unity of Semantic Artifacts	p. 32
Normal Form Bisimulations for Delimited-Control Operators	p. 47
Real-Time Persistent Queues and Deques with Logic Variables (Declarative Pearl)	p. 62
Declarative Debugging of Wrong and Missing Answers for SQL Views	p. 73
Improving the Performance of FD Constraint Solving in a CFLP System	p. 88
A General Implementation Framework for Tabled CLP	p. 104
Extending the TOy System with the ECL PSe Solver over Sets of Integers	p. 120
Sonia Estévez-Martín	p. 120
Correct Looping Arrows from Cyclic Terms: Traced Categorical Interpretation in Haskell	p. 136
A Lambda Calculus for Gödel-Durnmett Logic Capturing Waitfreedom	p. 151
Iteratees	p. 166
Mutual Exclusion by Interpolation	p. 182
Parallel Computation Skeletons with Premature Termination Property	p. 197
Calculational Developments of New Parallel Algorithms for Size-Constrained Maximum-Sum Segment Problems	p. 213
A Data Flow Language for Hybrid Query and Programming Languages	p. 228
Coinductive Constraint Logic Programming	p. 243
A Call-by-Name CPS Hierarchy	p. 260
Exact Flow Analysis by Higher-Order Model Checking	p. 275
Computing in Cantor's Paradise With ¿ZFC	p. 290
The Finite Domain Constraint Solver of SWI-Prolog	p. 307
Explicit Binds: Effortless Efficiency with and without Trees	p. 317
Author Index	p. 333
Table of Contents provided by Ingram. All Rights Reserved.