Functional and constraint logic programming
Starting at a seminal paper published by J. Jaffar and J. L. Lassez in 1987, Constraint Logic Programming (CLP) has developed as a powerful programming paradigm which supports a clean combination of logic (in the form of Horn clauses) and domain-specific methods for constraint satisfaction, simplification and optimization. The well established mathematical foundations of logic programming have been successfully extended to CLP. Simultaneously, practical applications of CLP have arisen in many fields. On the other hand, the combination of logic programming with other declarative programming paradigms (especially functional programming) has been widely investigated during the last decade, leading to useful insights for the design of more expressive declarative languages. The first attempt to combine functional and logic languages was done by J. A. Robinson and E. E. Sibert when proposing the language LOGLISP. For the entire collection see [Zbl 0961.00024].
- Editorial: Functional and (constraint) logic programming
- Extra variables can be eliminated from functional logic programs
- Equivalence of two formal semantics for functional logic programs
- Towards a parallel virtual machine for functional logic programming
- scientific article; zbMATH DE number 4191084 (Why is no real title available?)
- scientific article; zbMATH DE number 4164127 (Why is no real title available?)
- Absys: the first logic programming language —A retrospective and a commentary
- Multi-paradigm Declarative Languages
- scientific article; zbMATH DE number 50050 (Why is no real title available?)
- scientific article; zbMATH DE number 1336275 (Why is no real title available?)
- scientific article; zbMATH DE number 1954119 (Why is no real title available?)
- Logic programming in the context of multiparadigm programming: the Oz experience
- Functional Logic Programming: From Theory to Curry
- Logic programming, functional programming, and inductive definitions
- Role of logic programming in the FGCS project
- Flexible coinductive logic programming
- Qualified Computations in Functional Logic Programming
- Rewriting and Call-Time Choice: The HO Case
- A new generic scheme for functional logic programming with constraints
- A functorial framework for constraint normal logic programming
This page was built for publication: Functional and constraint logic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2762632)