@InProceedings{Schulte:2000,
      AUTHOR = {Schulte, Christian},
      TITLE = {Programming Deep Concurrent Constraint Combinators},
      YEAR = {2000},
      BOOKTITLE = {Practical Aspects of Declarative Languages, Second International Workshop, PADL 2000, January 17-18},
      NUMBER = {1753},
      PAGES = {215-229},
      EDITOR = {Pontelli, E. and Santos Costa, V.},
      SERIES = {Lecture Notes in Computer Science},
      ADDRESS = {Boston, Massachusetts, USA},
      PUBLISHER = {Springer},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/combinators.ps.gz},
      ABSTRACT = {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.},
      ANNOTE = {COLIURL : Schulte:2000:PDC.pdf Schulte:2000:PDC.ps}
}