Publication details

Programming Systems

Gert Smolka

Publications

Teaching

Software

Formalizations

Programming Deep Concurrent Constraint Combinators

Christian Schulte

Practical Aspects of Declarative Languages, Second International Workshop, PADL 2000, Vol. 1753 of Lecture Notes in Computer Science, pp. 215--229, Springer-Verlag, January 2000

Constraint combination methods are essential for a flexible constraint programming system. This paper presents deep concurrent constraint combinators based on computation spaces as combination mechanism. It introduces primitives and techniques needed to program constraint combinators from computation spaces. The paper applies computation spaces to a broad range of combinators: negation, generalized reification, disjunction, and implication. Even though computation spaces have been conceived in the context of Oz, they are mainly programming language independent. This point is stressed by discussing them here in the context of Standard ML with concurrency features.

Download PDF        Show BibTeX               

@INPROCEEDINGS{Schulte:00,
  title = {Programming Deep Concurrent Constraint Combinators},
  author = {Christian Schulte},
  year = {2000},
  month = {jan},
  editor = {"Enrico Pontelli and Vítor Santos Costa"},
  publisher = {"Springer-Verlag"},
  booktitle = {Practical Aspects of Declarative Languages, Second                   International Workshop, PADL 2000},
  series = {"Lecture Notes in Computer Science"},
  volume = {1753},
  pages = {"215--229"},
  address = {"Boston, MA, USA"},
}

Login to edit