CLP and constraint abstraction

@inproceedings{Hickey1989CLPAC,
  title={CLP and constraint abstraction},
  author={Timothy J. Hickey},
  booktitle={POPL '89},
  year={1989}
}
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… CONTINUE READING

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-3 OF 3 CITATIONS

The design and implementation of Kaleidoscope'90-A constraint imperative programming language

  • Proceedings of the 1992 International Conference on Computer Languages
  • 1992
VIEW 1 EXCERPT
CITES METHODS

Implementing a Meta-Logical Scheme

VIEW 1 EXCERPT
CITES METHODS