My Account Log in

1 option

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

ACM Digital Library Available online

View online
Format:
Book
Conference/Event
Contributor:
Blume, Matthias, 1966-
Kobayashi, Naoki.
Vidal, Germán.
Conference Name:
Fuji International Symposium on Functional and Logic Programming (10th : 2010 : Sendai-shi, Japan)
Series:
Theoretical Computer Science and General Issues, 2512-2029 ; 6009
Language:
English
Subjects (All):
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 Intelligence.
Local Subjects:
Programming Techniques.
Software Engineering.
Computer Science Logic and Foundations of Programming.
Compilers and Interpreters.
Formal Languages and Automata Theory.
Artificial Intelligence.
Physical Description:
1 online resource (XI, 355 p. 46 illus.)
Edition:
1st ed. 2010.
Place of Publication:
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2010.
Language Note:
English
Summary:
This volume contains the proceedings of the 10th International Symposium on Functional and LogicProgramming(FLOPS 2010),held in Sendai, Japan, April 19-21, 2010 at Aoba Memorial Hall, Tohoku University. FLOPS is a forum for research on all issues concerning declarative progr- ming, including functional programming and logic programming, and aims to promotecross-fertilizationand integrationbetween the two paradigms.The p- vious FLOPS meetings were held in Fuji Susono (1995), Shonan Village (1996), Kyoto (1998), Tsukuba (1999), Tokyo (2001), Aizu (2002), Nara (2004), Fuji Susono (2006), and Ise (2008). Since its 1999 edition, FLOPS proceedings have been published by Springer in its Lecture Notes in Computer Science series, as volumes 1722, 2024, 2441, 2998, 3945, and 4989, respectively. In response to the call for papers, 49 papers were submitted. Each paper was reviewed by at least three Program Committee members, with the help of expert external reviewers. The Program Committee meeting was conducted electronically, for a period of two weeks, in December 2009. After careful and thoroughdiscussion,theProgramCommitteeselected21papersforpresentation at the conference. In addition to the 21 contributed papers, the symposium included talks by three invited speakers: Brigitte Pientka (McGill University, Canada), Kostis Sagonas (National Technical University of Athens, Greece), and Naoyuki Tamura (Kobe University, Japan).
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.
Notes:
Bibliographic Level Mode of Issuance: Monograph
Includes bibliographical references and index.
ISBN:
1-280-38608-8
9786613564009
3-642-12251-5

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account