CLP and constraint abstraction

Authors:
T. J. Hickey
Affiliations:
Department of Computer Science, Brandeis University, Waltham, MA
Venue:
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Year:
1989

Citing 2
Cited 1

Constraint logic programming

POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Rabbit: A Compiler for Scheme

Rabbit: A Compiler for Scheme

Toward the partial evaluation of CLP languages

PEPM '91 Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

CLP*(D) is a class of constraint logic programming languages which incorporates the notion of abstraction. Predicates in CLP*(D) are (potentially) infinite rational trees which represent abstractions of constraint expressions. This view of predicates as constraint abstractions was motivated by the language Scheme, where closures are viewed as abstractions of functional expressions. A semantics and an efficient implementation of the language are provided, along with several examples of the novel programming techniques provided by this class of languages.