Functional and Constraint Logic Programming: 18th International Workshop, WFLP 2009, Brasilia, Brazil, June 28, 2009, Revised Selected Papers

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

This book constitutes the thoroughly refereed post-conference proceedings of the 18th International Workshop on Functional and Constraint Logic Programming, WFLP 2009, held in Brasilia, Brazil, in June 2009 as part of RDP 2009, the Federated Conference on Rewriting, Deduction, and Programming. The 9 revised full papers presented together with 2 invited papers were carefully reviewed and selected from 14 initial workshop contributions. The papers cover current research in all areas of functional and constraint logic programming including typical areas of interest, such as foundational issues, language design, implementation, transformation and analysis, software engineering, integration of paradigms, and applications.

Author(s): Roberto Ierusalimschy (auth.), Santiago Escobar (eds.)
Series: Lecture Notes in Computer Science 5979 : Theoretical Computer Science and General Issues
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2010

Language: English
Pages: 179
Tags: Mathematical Logic and Formal Languages; Software Engineering; Logics and Meanings of Programs; Programming Languages, Compilers, Interpreters; Artificial Intelligence (incl. Robotics)

Front Matter....Pages -
Programming with Multiple Paradigms in Lua....Pages 1-12
Constraint Based Strategies....Pages 13-26
Integrating ILOG CP Technology into $\mathcal{TOY}$ ....Pages 27-43
Termination of Context-Sensitive Rewriting with Built-In Numbers and Collection Data Structures....Pages 44-61
Semantic Labelling for Proving Termination of Combinatory Reduction Systems....Pages 62-78
A Taxonomy of Some Right-to-Left String-Matching Algorithms....Pages 79-95
Type Checking and Inference Are Equivalent in Lambda Calculi with Existential Types....Pages 96-110
Fast and Accurate Strong Termination Analysis with an Application to Partial Evaluation....Pages 111-127
New Results on Type Systems for Functional Logic Programming....Pages 128-144
A Simple Region Inference Algorithm for a First-Order Functional Language....Pages 145-161
A Theoretical Framework for the Declarative Debugging of Functional Logic Programs with Lambda Abstractions....Pages 162-178
Back Matter....Pages -