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

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Blume, Matthias (Επιμελητής έκδοσης), Kobayashi, Naoki (Επιμελητής έκδοσης), Vidal, Germán (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010.
• Σειρά: Lecture Notes in Computer Science, 6009
• Θέματα: Computer science.; Computer programming.; Software engineering.; Programming languages (Electronic computers).; Computer logic.; Mathematical logic.; Artificial intelligence.; Computer Science.; Programming Techniques.; Software Engineering.; Logics and Meanings of Programs.; Programming Languages, Compilers, Interpreters.; Mathematical Logic and Formal Languages.; Artificial Intelligence (incl. Robotics).

Πίνακας περιεχομένων:

• 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.