Abstract
This chapter discusses composable concurrent constraint combinators programmed from spaces. Spaces are applied to a broad range of combinators: negation, generalized reification, disjunction, and implication (conditional). It is empirically shown that a space-based implementation of combinators is competitive with a native C++-based implementation.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2002). Constraint Combinators. In: Schulte, C. (eds) Programming Constraint Services. Lecture Notes in Computer Science(), vol 2302. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45945-6_11
Download citation
DOI: https://doi.org/10.1007/3-540-45945-6_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43371-2
Online ISBN: 978-3-540-45945-3
eBook Packages: Springer Book Archive