Abstract
Compositionlity is a critical design idea for the design of complex computational systems. We argue that concurrent constraint programming provides powerful techniques for compositional construction, allowing modularity – hence separation and partitioning – and yet openess and interdependence, via constraint-based communication.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. de Kleer & J. S. Brown. (1984). Qualitative Reasoning about Physical Systems, chapter Qualitative Physics Based on Confluences. MIT Press, 1985. Also published in AIJ.
V. Gupta, R. Jagadeesan, & V. Saraswat. (to appear). Computing with continuous change. Science of Computer Programming.
V.A. Saraswat, R. Jagadeesan, & V. Gupta. (1995). Timed Default Concurrent Constraint Programming. Journal of Symbolic Computation. To appear. Extended abstract appeared in the Proceedings of the 22nd ACM Symposium on Principles of Programming Languages, San Francisco.
V.A. Saraswat, R. Jagadeesan, & V. Gupta. (1994). Foundations of Timed Concurrent Constraint Program-ming. In Samson Abramsky, editor, Proceedings of the Ninth Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Press.
V.A. Saraswat, M. Rinard, & P. Panangaden. (1991). Semantic foundations of concurrent constraint program-ming. In Proceedings of Eighteenth ACM Symposium on Principles of Programming Languages, Orlando.
V.A. Saraswat. (1993). Concurrent Constraint Programming. Logic Programming and Doctoral Dissertation Award Series. MIT Press.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Saraswat, V. Compositional Computing. Constraints 2, 95–97 (1997). https://doi.org/10.1023/A:1009761309494
Issue Date:
DOI: https://doi.org/10.1023/A:1009761309494