Central Library

Normal view MARC view ISBD view

Functional and Logic Programming [electronic resource] : 10th International Symposium, FLOPS 2010, Sendai, Japan, April 19-21, 2010, Proceedings / edited by Matthias Blume, Naoki Kobayashi, Germán Vidal-Oriola.

Contributor(s): Blume, Matthias [editor.] | Kobayashi, Naoki [editor.] | Vidal-Oriola, Germán [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Theoretical Computer Science and General Issues: 6009Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2010Edition: 1st ed. 2010.Description: XI, 355 p. 46 illus. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783642122514.Subject(s): Computer programming | Software engineering | Computer science | Compilers (Computer programs) | Machine theory | Artificial intelligence | Programming Techniques | Software Engineering | Computer Science Logic and Foundations of Programming | Compilers and Interpreters | Formal Languages and Automata Theory | Artificial IntelligenceAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 005.11 Online resources: Click here to access online
Contents:
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.
In: Springer Nature eBook
    average rating: 0.0 (0 votes)
No physical items for this record

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.

There are no comments for this item.

Log in to your account to post a comment.