Functional and Logic Programming

10th International Symposium, FLOPS 2010, Sendai, Japan, April 19-21, 2010. Proceedings

Editors:

ISBN: 978-3-642-12250-7 (Print) 978-3-642-12251-4 (Online)

Table of contents (24 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. Invited Talks

    1. No Access

      Book Chapter

      Pages 1-12

      Beluga: Programming with Dependent Types, Contextual Data, and Contexts

    2. No Access

      Book Chapter

      Pages 13-18

      Using Static Analysis to Detect Type Errors and Concurrency Defects in Erlang Programs

    3. No Access

      Book Chapter

      Pages 19-23

      Solving Constraint Satisfaction Problems with SAT Technology

  3. Refereed Papers

    1. Logic Programming

      1. No Access

        Book Chapter

        Pages 165-174

        A Pearl on SAT Solving in Prolog

      2. No Access

        Book Chapter

        Pages 175-190

        Automatically Generating Counterexamples to Naive Free Theorems

      3. No Access

        Book Chapter

        Pages 191-206

        Applying Constraint Logic Programming to SQL Test Case Generation

      Evaluation and Normalization

      1. No Access

        Book Chapter

        Pages 207-223

        Internal Normalization, Compilation and Decompilation for System \({\mathcal F}_{\beta\eta}\)

      2. No Access

        Book Chapter

        Pages 224-239

        Towards Normalization by Evaluation for the βη-Calculus of Constructions

      3. No Access

        Book Chapter

        Pages 240-256

        Defunctionalized Interpreters for Call-by-Need Evaluation

      Term Rewriting

      1. No Access

        Book Chapter

        Pages 257-271

        Complexity Analysis by Graph Rewriting

      2. No Access

        Book Chapter

        Pages 272-287

        Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and λ-Calculus

      Types

      1. No Access

        Book Chapter

        Pages 24-39

        A Church-Style Intermediate Language for ML F

      2. No Access

        Book Chapter

        Pages 40-55

        ΠΣ: Dependent Types without the Sugar

      3. No Access

        Book Chapter

        Pages 56-71

        Haskell Type Constraints Unleashed

      Program Analysis and Transformation

      1. No Access

        Book Chapter

        Pages 72-86

        A Functional Framework for Result Checking

      2. No Access

        Book Chapter

        Pages 87-102

        Tag-Free Combinators for Binding-Time Polymorphic Program Generation

      3. No Access

        Book Chapter

        Pages 103-117

        Code Generation via Higher-Order Rewrite Systems

      Foundations

      1. No Access

        Book Chapter

        Pages 118-133

        A Complete Axiomatization of Strict Equality

      2. No Access

        Book Chapter

        Pages 134-149

        Standardization and Böhm Trees for Λμ-Calculus

      3. No Access

        Book Chapter

        Pages 150-164

        An Integrated Distance for Atoms

previous Page of 2