- Published 2000

This thesis presents design, application, implementation, and evaluation of computation spaces as abstractions for programming constraint services at a high level. Spaces are seamlessly integrated into a concurrent programming language and make constraintbased computations compatible with concurrency through encapsulation. Spaces are applied to search and combinators as essential constraint services. Stateof-the-art and new search engines such as visual interactive search and parallel search are covered. Search is expressive and concurrency-compatible by using copying rather than trailing. Search is space and time efficient by using recomputation. Composable combinators, also known as deep-guard combinators, stress the control facilities and concurrency integration of spaces. The implementation of spaces comes as an orthogonal extension to the implementation of the underlying programming language. The resulting implementation is shown to be competitive with existing constraint programming systems.

Showing 1-10 of 74 extracted citations

Highly Influenced

16 Excerpts

Highly Influenced

20 Excerpts

Highly Influenced

10 Excerpts

Highly Influenced

7 Excerpts

Highly Influenced

4 Excerpts

Highly Influenced

7 Excerpts

Highly Influenced

6 Excerpts

Highly Influenced

5 Excerpts

Highly Influenced

6 Excerpts

Highly Influenced

4 Excerpts

Showing 1-10 of 112 references

Highly Influential

10 Excerpts

Highly Influential

16 Excerpts

Highly Influential

9 Excerpts

Highly Influential

7 Excerpts

Highly Influential

6 Excerpts

Highly Influential

4 Excerpts

Highly Influential

12 Excerpts

Highly Influential

18 Excerpts

Highly Influential

20 Excerpts

Highly Influential

19 Excerpts

@inproceedings{Schulte2000ProgrammingCS,
title={Programming constraint services},
author={Christian Schulte},
year={2000}
}