AbstractConcurrent Constraint Programming (CCP) has been the subject of growing interest as the focus of a new paradigm for concurrent computation. Like logic programming it claims close relations to logic. In fact CCP languages are logics in a certain sense that we make precise in this paper. In recent work it was shown that the denotational semantics of determinate concurrent constraint programming languages forms a fibred categorical structure called a hyperdoctrine, which is used as the basis of the categorical formulation of first-order logic. What this shows is that the combinators of determinate CCP can be viewed as logical connectives. In this paper we extend these ideas to the operational semantics of such languages and thus make available similar analogies for a much broader variety of languages including indeterminate CCP languages and concurrent block-structured imperative languages.
Categories and Subject Descriptors: F.3.1 [Logics and Meanings of Programs]: Specifying and Verifying and Reasoning about Programs; F.3.2 [Logics and Meanings of Programs]: Semantics of Programming Languages; D.1.3 [Programming Techniques]: Concurrent Programming; D.3.3 [Programming Languages]: Language Constructs and Features
Additional Key Words and Phrases: concurrent constraint programming, simulation, logic, categories, hyperdoctrines
Selected papers that cite this one
- Sven-Olof Nyström and Bengt Jonsson. A fully abstract semantics for concurrent constraint programming. Information and Computation, 146(2):138-180, 1 November 1998.
Selected references
- Samson Abramsky. A domain equation for bisimulation. Information and Computation, 92(2):161-218, June 1991.
- Stephen Brookes. Full abstraction for a shared variable parallel language. In Proceedings, Eighth Annual IEEE Symposium on Logic in Computer Science, pages 98-109, Montreal, Canada, 19-23 June 1993. IEEE Computer Society Press.
- Eiichi Horita, J. W. de Bakker, and J. J. M. M. Rutten. Fully abstract denotational models for nonuniform concurrent languages. Information and Computation, 115(1):125-178, 15 November 1994.
- André Joyal, Mogens Nielsen, and Glynn Winskel. Bisimulation and open maps. In Proceedings, Eighth Annual IEEE Symposium on Logic in Computer Science, pages 418-427, Montreal, Canada, 19-23 June 1993. IEEE Computer Society Press.
- Dale Miller. A multiple-conclusion meta-logic. In Proceedings, Ninth Annual IEEE Symposium on Logic in Computer Science, pages 272-281, Paris, France, 4-7 July 1994. IEEE Computer Society Press.
- Prakash Panangaden and Vasant Shanbhogue. The expressive power of indeterminate dataflow primitives. Information and Computation, 98(1):99-131, May 1992.
- Vijay A. Saraswat and Martin C. Rinard. Concurrent constraint programming. In Conference Record of the Seventeenth Annual ACM Symposium on Principles of Programming Languages, pages 232-245, San Francisco, California, January 1990.
- Vijay A. Saraswat, Martin C. Rinard, and Prakash Panangaden. Semantic foundations of concurrent constraint programming. In Conference Record of the Eighteenth Annual ACM Symposium on Principles of Programming Languages, pages 333-352, Orlando, Florida, January 1991.