10. FLOPS 2010: Sendai, Japan

Matthias Blume, Naoki Kobayashi, Germán Vidal (Eds.): Functional and Logic Programming, 10th International Symposium, FLOPS 2010, Sendai, Japan, April 19-21, 2010. Proceedings. Lecture Notes in Computer Science 6009 Springer 2010, ISBN 978-3-642-12250-7

Invited Talks

Brigitte Pientka:
Beluga: Programming with Dependent Types, Contextual Data, and Contexts. 1-12
Konstantinos F. Sagonas:
Using Static Analysis to Detect Type Errors and Concurrency Defects in Erlang Programs. 13-18
Naoyuki Tamura, Tomoya Tanjo, Mutsunori Banbara:
Solving Constraint Satisfaction Problems with SAT Technology. 19-23

Types

Didier Rémy, Boris Yakobowski:
A Church-Style Intermediate Language for ML^F. 24-39
Thorsten Altenkirch, Nils Anders Danielsson, Andres Löh, Nicolas Oury:
PiSigma: Dependent Types without the Sugar. 40-55
Dominic A. Orchard, Tom Schrijvers:
Haskell Type Constraints Unleashed. 56-71

Program Analysis and Transformation

Gilles Barthe, Pablo Buiras, César Kunz:
A Functional Framework for Result Checking. 72-86
Peter Thiemann, Martin Sulzmann:
Tag-Free Combinators for Binding-Time Polymorphic Program Generation. 87-102
Florian Haftmann, Tobias Nipkow:
Code Generation via Higher-Order Rewrite Systems. 103-117

Foundations

Javier Álvez, Francisco Javier López-Fraguas:
A Complete Axiomatization of Strict Equality. 118-133
Alexis Saurin:
Standardization and Böhm Trees for Lambdaµ-Calculus. 134-149
Vicent Estruch, César Ferri, José Hernández-Orallo, M. José Ramírez-Quintana:
An Integrated Distance for Atoms. 150-164

Logic Programming

Jacob M. Howe, Andy King:
A Pearl on SAT Solving in Prolog. 165-174
Daniel Seidel, Janis Voigtländer:
Automatically Generating Counterexamples to Naive Free Theorems. 175-190
Rafael Caballero, Yolanda García-Ruiz, Fernando Sáenz-Pérez:
Applying Constraint Logic Programming to SQL Test Case Generation. 191-206

Evaluation and Normalization

Stefano Berardi, Makoto Tatsuta:
Internal Normalization, Compilation and Decompilation for System F_bh. 207-223
Andreas Abel:
Towards Normalization by Evaluation for the betaeta-Calculus of Constructions. 224-239
Olivier Danvy, Kevin Millikin, Johan Munk, Ian Zerny:
Defunctionalized Interpreters for Call-by-Need Evaluation. 240-256

Term Rewriting

Martin Avanzini, Georg Moser:
Complexity Analysis by Graph Rewriting. 257-271
Jeroen Ketema, Jakob Grue Simonsen:
Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and lambda-Calculus. 272-287
Naoki Nishida, Masahiko Sakai:
Proving Injectivity of Functions via Program Inversion in Term Rewriting. 288-303

Parallelism and Control

Oleg Kiselyov:
Delimited Control in OCaml, Abstractly and Concretely: System Description. 304-320
Akimasa Morihata, Kiminori Matsuzaki:
Automatic Parallelization of Recursive Functions Using Quantifier Elimination. 321-336
Mischa Dieterle, Jost Berthold, Rita Loogen:
A Skeleton for Distributed Work Pools in Eden. 337-353

Last update Wed May 22 04:35:49 2013 CET by the DBLP Team —

This material is Open Data

Data released under the ODC-BY 1.0 license — See also our legal information page