Semantic foundations of concurrent constraint programming

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 1991, Pages 333-352

  Saraswat, Vijay A ^a   Rinard, Martin ^b   Panangaclen, Prakash ^c  

^a PALO ALTO RESEARCH CENTER   (United States)

^b STANFORD UNIVERSITY   (United States)

^c MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER CIRCUITS; CONSTRAINT THEORY; LOGIC PROGRAMMING; MODELING LANGUAGES; RANGE FINDING; SEMANTICS;

COMPLETE AXIOMATIZATIONS; CONCURRENT COMPUTATION; CONCURRENT CONSTRAINT PROGRAMMING; CONCURRENT LOGIC PROGRAMMING; EXISTENTIAL QUANTIFIERS; LOGIC PROGRAMMING SEMANTICS; OPERATIONAL SEMANTICS; PARALLEL COMPOSITION;

COMPUTER PROGRAMMING LANGUAGES;

EID: 85047788507     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/99583.99627     Document Type: Conference Paper

References (41)

1. Arvind, Rlshiyur Nikhil, and Keshav K. Pingali. I-structuers: datstructures for parallel computing. ACM Transactions on Principles of Programming Languages, 11(4):598-632, October 1989.
2. G. Boudol and G. Berry. The chemical abstract machine. In Proceedings of the 17th Annual ACM Symposium on Principles of Programming Languages, pages 81-94. ACM, 1990.
3. Mani Chandy and Jay Misra. Parallel Program Design-A foundation. Addison Wesley, 1988.
4. F, S. de Boer and C. Palamidessi. A fully abstract model for concurrent constraint logic languages. In Proceedings of CONCUR 90, 1990.
5. F. S. de Boer and C. Palamidessi. A fully abstract model for concurrent constraint programming. June 4 1990.
6. Doug DeGroot and Gary Lindstrom, editors. Logic Programming: Functions, Relations and Equations. Prentice Hall, 1986.
7. Ian Foster and Steve Taylor. Strand: New concepts in parallel programming. Prentice Hall, 1989.
8. Rob Gerth, Mike Codish, Yossi Liechtenstein, and Ehud Shapiro. A fully abstract denotational semantics for Flat Concurrent Prolog. In LICS 88, 1988.
9. J.-Y. Girard. Linear logic. Theoreticcd Computer Science, 50:1-102, 1987.
10. J.-Y. Girard. Proofs and Types, volume 7 of Cambridge tracts in Theoretical Cornputer Science. Cambridge University Press, 1989. Translated and with appendices by Y. Lafont and P. Taylor.
11. G. Gierz, K. H. Hoffman, K. Keimel, J. D. Law50n, M. Mislove, and D. S. Scott, editors. A COnlpendiwn of continuous lattices. Springer-Verlag Berlin Heidelberg New York, 1980.
12. M. Gabbrielli and G. Levi. Unfolding and fixpoint semantics of concurrent constraint logic programs, Technical report, University of Piss, 1990.
13. Haim Gaifman, Michael J. Maher, and Ehud Shapiro. Reactive behavior semantics for concurrent constraint logic programs. In North A mer-ican Logic Programming Conference. MIT Press, October 1989.
14. Leon Henkin, J. Donald Monk, and Alfred Tarski. Cylindric Algebras (Part I). North Holland Publishing Company, 1971.
15. C.A. R. Hoare. A theory of conjunction and concurrency. Oxford PRG, May 1989.
16. C.A.R. Hoare. Lets make models. In Proceedings Of CONCUR 90, August 1990.
17. Joxan Jaffar and Jean-Louis Lassez. Constraint logic programming. In Proceedings of the SIGA CT-SIGPLAN Symposium on Princi. pies of Programming Languages, pages 111-119, ACM, January 1987.
18. Mark B. Josephs. Receptive process theory. Technical report, Programming Research Group, Oxford University, July 1990.
19. R. Jagadeesan and P. Panangaden. A domaintheoretic model of a higher-order process cal-CUIUS. In M. S. Paterson, editor, The Seventeenth International Colloquium On Automata Languages And Programming, pages 181-194. Springer-Verlag, 1990. Lecture Notes In Computer Science 443.
20. R. Jagadeesan, P. Panangaden, and K. Pingali. A fully abstract semantics for a functional language with logic variables. In Proceedings Of IEEE Symposium on Logic in Computer Science, pages 294-303, 1989.
21. G. Kahn. The semantics of a simple language for parallel programming. In J.L. Rosenfeld, editor, Proceedings of IFIP Congress 7J, pages 471-475., August 1974.
22. S. Kliger, E. Yardeni, E. Shapiro, and K, Kahn, The language fcp . In Conference on Fifth Generation Computer Systems, December 1988.
23. Giorgio Levi. Models, unfolding rules and fixpoint semantics. In Proceedings of the Fifth International Conference and Symposium on Logic Programming, Seattle, pages 1649-1665, August 1988.
24. Gary Lindstrom. Functional programming and the logical variable. In Proceedings of the Twelfth ACM Symposium on Principles of Programming Languages, pages 266-280, January 1985.
25. J. Lambek and P. Scott. An introduction to higher-order categorical logic, volume 7 of Studies in Advanced Mathematics. Cambridge University Press, 1986.
26. Michael Maher. Logic semantics for a class of committed-choice programs. In 4 th In tern ational Conference on Logic Programming. MIT Press, May 1987
27. R. Milner. Functions as processes. In M. S. Paterson, editor, The Seventeenth International Colloquium On Automata Languages And Programming, pages 167-180. Springer-Verlag, 1990. Lecture Notes In Computer Science 443.
28. R. Milner, J. G. Parrow, and D. J. Walker. A calculus for mobile processes. LFCS Report EC SLFCS-89-85, University of Edinburgh, 1989.
29. M. Makkai and G. Reyes. First order cutegoricai logic, volume 611 of Lecture Notes in Mathematics. Springer-Verlag, 197.
30. E.-R. Olderog and C.A.R. Hoare. Specificationoriented semantics for communicating processes. Acts Informatica, 23:9-66, 1986.
31. G.D. Plotkin. A powerdomain construction. SIAM J. of Computing, 5(3):452-487, September 1976.
32. A. W. Roscoe. An alternative order for the failures model. Technical Report Technical Monograph PRG-67, Programming Research Group, Oxford University, July 1988.
33. Vijay A. Saraswat. Partial correctness semantics for cp(1), In Proceedings of the FSTTCS Conference, number 206, pages 347-368. Springer-Verlag, December 1985.
34. ViJay A. Saraswat. A somewhat logical formulation of CLP synchronization primitives. In Proceedings of LP 88. MIT Press, August 1988.
35. Vijay A. Saraswat. Concurrent Constraint Programming Languages. PhD thesis, Carnegie-Mellon University, January 1989. To appear, Doctoral Dissertation Award and Logic Programming Series, MIT Press, 1990.
36. Dana S. Scott. Data types as lattices. SIAM, 5(3):522-587, 1976
37. Dana S. Scott. Domains for denotational semantics. In Proceedings of ICALP, 1982.
38. Vijay A. Saraswat, Ken Kahn, and Jacob Levy. Jan us: A step towards distributed constraint programming. In Proceedings of the North American Conference on Logic Programming, October 1990.
39. Vijay A. Saraswat, Prakash Panangaden, and Martin Rinard. What is a constraint? Technical report, Xerox PARC, forthcoming.
40. Vijay A. Saraswat and Martin Rinard. Concurrent constraint programming. In Proceedings of Seventeenth ACM Symposium on Principles of Programming Languages, San Fransisco, January 1990.
41. A. Tarski. Logics, semantics and metamathematics. Oxford University Press, 1956. Translated by J.H. Woodger.