Computing Publications

Publications Home » The Unification of Functional and...

The Unification of Functional and Logic Languages

John Darlington, A. J. Field, Helen Pull

Book Chapter
Logic Programming: Functions, Relations and Equations, DeGroot D. and Lindstrom, G. eds.
1986
pp.37–70
Prentice Hall
Abstract

We will present in this paper constraint functional programming as a new declarative programming paradigm. A constraint functional programming (CFP) system is an integrated declarative programming system in which functional programming can be achieved by evaluating expressions on the computational domains. At the same time, logic programming can also be achieved by solving constraints over these domains. CFP is developed from the notion of absolute set abstraction, a language construct in functional languages acting as the "logic programming facility". CFP systematically unifies functional programming and logic programming from a fundamental semantic level and so is expected to provide great expressive power which comes from the natural merging of the solving and evaluating in an integrated system. Taking advantage of the domain-based programming style of functional programming, problem solving in CFP is directly performed on the intended domain of discourse in contrast to traditional logic programming which works only on the Herbrand universe. This property also allows some algorithmic constraint solving techniques to be exploited and restricts the search space in the computation to make the systcni be efficiently implementable.

Keywords
AESOP
PDF of full publication (923 kilobytes)
(need help viewing PDF files?)
BibTEX file for the publication
N.B.
Conditions for downloading publications from this site.
 

pubs.doc.ic.ac.uk: built & maintained by Ashok Argent-Katwala.