CLP and constraint abstraction

@inproceedings{Hickey1989CLPAC,
  title={CLP and constraint abstraction},
  author={T. Hickey},
  booktitle={POPL '89},
  year={1989}
}
  • T. Hickey
  • Published in POPL '89 1989
  • Computer Science
  • 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.

    Implementing a Meta-Logical Scheme
    A Constraint Logic Programming Shell
    • 11
    The Pandora Deadlock Handler Meta-Level Relation
    Declarative Internet Programming Constraint-based Optimization of Scheme Applets
    Toward the partial evaluation of CLP languages
    • 13