Constraint programming is a powerful paradigm for solving combinatorial search problems
that draws on a wide range of techniques from artificial intelligence, computer science …

The widespread use of object-oriented languages and Internet security concerns are just the
beginning. Add embedded systems, multiple memory banks, highly pipelined units …

Declarative multi-paradigm languages combine the most important features of functional,
logic and concurrent programming. The computational model of such integrated languages …

13. Implementing Spaces Page 1 13. Implementing Spaces This chapter discusses the
implementation of computation spaces. The implementation of Oz Light is extended by nodes …

Abstract Constraint Simplification Rules (CSR) is a subset of the Constraint Handling Rules
(CHR) language. CHR is a powerful special-purpose declarative programming language for …

In global computing applications the availability of a mechanism for some form of committed
choice can be useful, and sometimes necessary. It can conveniently handle, eg, distributed …

We present a calculus providing an abstract operational semantics for higherorder
concurrent constraint programming. The calculus is parameterized with a rst-order constraint …

This thesis presents design, application, implementation, and evaluation of computation
spaces as abstractions for programming constraint services at a high level. Spaces are …

LIFE is a programming language proposing to integrate logic programming, functional
programming, and object-oriented programming. It replaces first-order terms with ψ-terms …

Constraint combination methods are essential for a flexible constraint programming system.
This paper presents deep concurrent constraint combinators based on computation spaces …