TY  - BOOK
AU  - Blume,Matthias
AU  - Kobayashi,Naoki
AU  - Vidal,Germán
ED  - SpringerLink (Online service)
TI  - Functional and Logic Programming: 10th International Symposium, FLOPS 2010, Sendai, Japan, April 19-21, 2010. Proceedings 
T2  - Lecture Notes in Computer Science,
SN  - 9783642122514
AV  - QA76.758 
U1  - 005.1 23
PY  - 2010///
CY  - Berlin, Heidelberg
PB  - Springer Berlin Heidelberg
KW  - Computer science
KW  - Software engineering
KW  - Logic design
KW  - Artificial intelligence
KW  - Computer Science
KW  - Software Engineering
KW  - Logics and Meanings of Programs
KW  - Programming Languages, Compilers, Interpreters
KW  - Mathematical Logic and Formal Languages
KW  - Artificial Intelligence (incl. Robotics)
KW  - Programming Techniques
N1  - 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
UR  - http://dx.doi.org/10.1007/978-3-642-12251-4
ER  -