Functional and Constraint Logic Programming 18th International Workshop, WFLP 2009, Brasilia, Brazil, June 28, 2009, Revised Selected Papers / [electronic resource] :
edited by Santiago Escobar.
- 1st ed. 2010.
- IX, 179 p. 35 illus. online resource.
- Theoretical Computer Science and General Issues, 5979 2512-2029 ; .
- Theoretical Computer Science and General Issues, 5979 .
Invited Papers -- Programming with Multiple Paradigms in Lua -- Constraint Based Strategies -- Contributed Papers -- Integrating ILOG CP Technology into -- Termination of Context-Sensitive Rewriting with Built-In Numbers and Collection Data Structures -- Semantic Labelling for Proving Termination of Combinatory Reduction Systems -- A Taxonomy of Some Right-to-Left String-Matching Algorithms -- Type Checking and Inference Are Equivalent in Lambda Calculi with Existential Types -- Fast and Accurate Strong Termination Analysis with an Application to Partial Evaluation -- New Results on Type Systems for Functional Logic Programming -- A Simple Region Inference Algorithm for a First-Order Functional Language -- A Theoretical Framework for the Declarative Debugging of Functional Logic Programs with Lambda Abstractions.
9783642119996
10.1007/978-3-642-11999-6 doi
Machine theory.
Software engineering.
Computer science.
Compilers (Computer programs).
Artificial intelligence.
Formal Languages and Automata Theory.
Software Engineering.
Computer Science Logic and Foundations of Programming.
Compilers and Interpreters.
Artificial Intelligence.
QA267-268.5
005.131
Invited Papers -- Programming with Multiple Paradigms in Lua -- Constraint Based Strategies -- Contributed Papers -- Integrating ILOG CP Technology into -- Termination of Context-Sensitive Rewriting with Built-In Numbers and Collection Data Structures -- Semantic Labelling for Proving Termination of Combinatory Reduction Systems -- A Taxonomy of Some Right-to-Left String-Matching Algorithms -- Type Checking and Inference Are Equivalent in Lambda Calculi with Existential Types -- Fast and Accurate Strong Termination Analysis with an Application to Partial Evaluation -- New Results on Type Systems for Functional Logic Programming -- A Simple Region Inference Algorithm for a First-Order Functional Language -- A Theoretical Framework for the Declarative Debugging of Functional Logic Programs with Lambda Abstractions.
9783642119996
10.1007/978-3-642-11999-6 doi
Machine theory.
Software engineering.
Computer science.
Compilers (Computer programs).
Artificial intelligence.
Formal Languages and Automata Theory.
Software Engineering.
Computer Science Logic and Foundations of Programming.
Compilers and Interpreters.
Artificial Intelligence.
QA267-268.5
005.131