Article

Free access

The semantic foundations of concurrent constraint programming

Authors:

Vijay A. Saraswat,

Martin Rinard,

Prakash PanangadenAuthors Info & Claims

POPL '91: Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Pages 333 - 352

https://doi.org/10.1145/99583.99627

Published: 03 January 1991 Publication History

PDF eReader

References

[1]

Arvind, Rishiyur Nikhil, and Keshav K. Pingali. I-structuers: data-structures for parallel computing. A CM Transactions on Principles of Programming Languages, 11(4):598-632, October 1989.

Digital Library

Google Scholar

[2]

G. Boudol and G. Berry. The chemical abstract machine. In Proceedings o/ the 17th Annual A CM Symposium on Principles o/Programming Languages, pages 81-94. ACM, 1990.

Digital Library

Google Scholar

[3]

Mani Chandy and flay Misra. Parallel Program Design--A/oundation. Addison Wesley, 1988.

Digital Library

Google Scholar

[4]

F.S. de Boer and C. Palamidessi. A fully abstract model for concurrent constraint logic lant~ua~es. In Proceedings of CONCUR '90, 1990.

Google Scholar

[5]

F.S. de Boer and C. Palamidessi. A fully abstract model for concurrent constraint programming. June 4 1990.

Digital Library

Google Scholar

[6]

Doug DeGroot and Gary Lindstrom, editors. Logic Programming: Functions, Relations and Equations. Prentice Hall, 1986.

Digital Library

Google Scholar

[7]

Inn Foster and Steve Taylor. Strand: New concepts in parallel programming. Prentice Hall, 1989.

Digital Library

Google Scholar

[8]

Rob Gerth, Mike Codish, Yossi Lichtenstein, and Ehud Shapiro. A fully abstract denotational semantics for Flat Concurrent Prolog. In LICS 88, 1988.

Crossref

Google Scholar

[9]

J.-Y. Girard. Linear logic. Theoretical Computer Science, 50:1-102, 1987.

Digital Library

Google Scholar

[10]

J.-Y. Girard. Proofs and Types, volume 7 of Cambridge tracts in Theoretical Computer Science. Cambridge University Press, 1989. Translated and with appendices by Y. Lafont and P. Taylor.

Digital Library

Google Scholar

[11]

G.Gierz, K.H.Hoffman, K.Keimel, 3.D.Lawson, M.Mislove, and D.S.Scott, editors. A compendium of continuous lattices. Springer-Verlag Berlin Heidelberg New York, 1980.

Crossref

Google Scholar

[12]

M. Gabbrielli and G. Levi. Unfolding and fixpoint semantics of concurrent constraint logic programs. Technical report, University of Pisa, 1990.

Google Scholar

[13]

Haim Gaifman, Michael J. Maher, and Ehud Shapiro. Reactive behavior semantics for concurrent constraint logic programs. In North American Logic Programming Conference. MIT Press, October t 989.

Google Scholar

[14]

Leon Henldn, J. Donald Monk, and Alfred Tarsld. Cylindric Algebras (Part I). North Holland Publishing Company, 1971.

Google Scholar

[15]

C.A.R. Hoare. A theory of conjunction and concurrency. Oxford PRG, May 1989.

Google Scholar

[16]

C.A.R. Hoare. Let's make models. In Proceedings of CONCUR 90, August 1990.

Digital Library

Google Scholar

[17]

Joxan Jaffar and Jean-Louis Lassez. Constraint logic programming. In Proceedings of the SIGA CT-SIGPLAN Symposium on Principles of Programming Languages, pages 111-119. ACM, January 1987.

Digital Library

Google Scholar

[18]

Mark B. Josephs. Receptive process theory. Technical report, Programming Research Group, Oxford University, July 1990.

Google Scholar

[19]

R. Jagadeesan and P. Panangaden. A domaintheoretic model of a higher-order process calculus. 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.

Digital Library

Google Scholar

[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.

Digital Library

Google Scholar

[21]

G. Kahn. The semantics of a simple language for parallel programming. In J.L. Rosenfeld, editor, Proceeedings of IFIP Congress 74, pages 471- 475., August 1974.

Google Scholar

[22]

S. Kliger, E. Yardeni, E. Shapiro, and K. Kahn. The language fcp(:,?). In Conference on Fifth Generation Computer Systems, December 1988.

Google Scholar

[23]

Giorgio Levi. Models, unfolding rules and fixpoint semantics. In Proceeedings of the Fifth International Conference and Symposium on Logic Programming, Seattle, pages 1649-1665, August 1988.

Google Scholar

[24]

Gary Lindstrom. Functional programming and the logical variable. In Proceedings of the Twelfth A CM Symposium on Principles of Programming Languages, pages 266-280, January 1985.

Digital Library

Google Scholar

[25]

J. Lambek and P. Scott. An introduction to higher-order categorical logic, volume 7 of Studies in Advanced Mathematics. Cambridge University Press, 1986.

Digital Library

Google Scholar

[26]

Michael Maher. Logic semantics for a cla.ss of committed-choice programs. In .~th International Conference on Logic Programming. MIT Press, May 1987.

Google Scholar

[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.

Digital Library

Google Scholar

[28]

R. Mflner, J. G. Parrow, and D. J. Walker. A calculus for mobile processes. LFCS Report ECS- LFCS-89-85, University of Edinburgh, 1989.

Google Scholar

[29]

M. Makkai and G. Reyes. First order categorical logic, volume 611 of Lecture Notes in Mathematics. Springer-Verlag, 197.

Google Scholar

[30]

E.-R. Olderog and C.A.R. Hoare. Specificationoriented semantics for communicating processes. Acta Informatica, 23:9-66, 1986.

Digital Library

Google Scholar

[31]

G.D. Plotkin. A powerdomain construction. SIAM J. of Computing, 5(3):452-487, September 1976.

Crossref

Google Scholar

[32]

A.W. Roscoe. An alternative order for the failures model. Technical Report Technical Monograph PRG-67, Programming Research Group, Oxford University, July 1988.

Google Scholar

[33]

Vijay A. Saraswat. Partial correctness semantics for cp($,l, ~). In Proceedings of the FSTTCS Conference, number 206, pages 347- 368. Springer-Verlag, December 1985.

Digital Library

Google Scholar

[34]

Vijay A. Saraswat. A somewhat logical formulation of CLP synchronization primitives. In Proceedings of LP 88. MIT Press, August 1988.

Google Scholar

[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.

Digital Library

Google Scholar

[36]

Dana S. Scott. Data types as lattices. SIAM, 5(3):522-587, 1976.

Crossref

Google Scholar

[37]

Dana S. Scott. Domains fol denotational semantics. In Proceedings of ICALP, 1982.

Digital Library

Google Scholar

[38]

Vijay A. Saraswat, Ken Kahn, and Jacob Levy. Janus: A step towards distributed constraint programming. In Proceedings of the North American Conference on Logic Programming, October 1990.

Digital Library

Google Scholar

[39]

Vijay A. Saraswat, Prakash Panang~den, and Martin Rinard. What is a constraint? Technical report, Xerox PARC, forthcoming.

Google Scholar

[40]

Vijay A. Saraswat and Martin Rinard. Concurrent constraint programming. In Proceedings of Seventeenth A CM Symposium on Principles of Programming Languages, San Fransisco, January 1990.

Digital Library

Google Scholar

[41]

A. Tarski. Logics, semantics and metamathematics. Oxford University Press, 1956. Translated by J.H. Woodger.

Google Scholar

Cited By

View all

Li B(2024)GreatFree as a Generic Distributed Programming Language and the Foundation of the Cloud-Side Operating SystemInternational Journal of Advanced Network, Monitoring and Controls10.2478/ijanmc-2023-00788:4(66-81)Online publication date: 16-Mar-2024
https://doi.org/10.2478/ijanmc-2023-0078
Bussi LGadducci FSantini F(2022)Soft Concurrent Constraint Programming with Local VariablesCoordination Models and Languages10.1007/978-3-031-08143-9_10(159-177)Online publication date: 14-Jun-2022
https://doi.org/10.1007/978-3-031-08143-9_10
Gordon C(2021)Polymorphic Iterable Sequential Effect SystemsACM Transactions on Programming Languages and Systems10.1145/345027243:1(1-79)Online publication date: 17-Apr-2021
https://dl.acm.org/doi/10.1145/3450272
Show More Cited By

Recommendations

Type-theoretic foundations for concurrent object-oriented programing

A number of attempts have been made to obtain type systems for object-oriented programming. The view that lies common is “object-oriented programming = λ-calculus + record.” Based on an analogous view “concurrent object-oriented programming = concurrent ...
Type-theoretic foundations for concurrent object-oriented programing
OOPSLA '94: Proceedings of the ninth annual conference on Object-oriented programming systems, language, and applications

A number of attempts have been made to obtain type systems for object-oriented programming. The view that lies common is “object-oriented programming = λ-calculus + record.” Based on an analogous view “concurrent object-oriented programming = concurrent ...
Soft concurrent constraint programming

Soft constraints extend classical constraints to represent multiple consistency levels, and thus provide a way to express preferences, fuzziness, and uncertainty. While there are many soft constraint solving formalisms, even distributed ones, as yet ...

Comments

Information & Contributors

Information

Published In

POPL '91: Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

January 1991

366 pages

ISBN:0897914198

DOI:10.1145/99583

Chairman:
David Wise
Indiana Univ., Bloomington

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 03 January 1991

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

POPL91

Sponsor:

POPL91: 18th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages

January 21 - 23, 1991

Florida, Orlando, USA

Acceptance Rates

POPL '91 Paper Acceptance Rate 31 of 152 submissions, 20%;

Overall Acceptance Rate 824 of 4,130 submissions, 20%

Upcoming Conference

POPL '25

Sponsor:
sigplan

The 52nd Annual ACM SIGPLAN Symposium on Principles of Programming Languages

January 19 - 25, 2025

Denver , CO , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

214
Total Citations
View Citations
1,137
Total Downloads

Downloads (Last 12 months)111
Downloads (Last 6 weeks)11

Reflects downloads up to 09 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Li B(2024)GreatFree as a Generic Distributed Programming Language and the Foundation of the Cloud-Side Operating SystemInternational Journal of Advanced Network, Monitoring and Controls10.2478/ijanmc-2023-00788:4(66-81)Online publication date: 16-Mar-2024
https://doi.org/10.2478/ijanmc-2023-0078
Bussi LGadducci FSantini F(2022)Soft Concurrent Constraint Programming with Local VariablesCoordination Models and Languages10.1007/978-3-031-08143-9_10(159-177)Online publication date: 14-Jun-2022
https://doi.org/10.1007/978-3-031-08143-9_10
Gordon C(2021)Polymorphic Iterable Sequential Effect SystemsACM Transactions on Programming Languages and Systems10.1145/345027243:1(1-79)Online publication date: 17-Apr-2021
https://dl.acm.org/doi/10.1145/3450272
Dokter KGadducci FLion BSantini F(2021)Soft constraint automata with memoryJournal of Logical and Algebraic Methods in Programming10.1016/j.jlamp.2020.100615118(100615)Online publication date: Jan-2021
https://doi.org/10.1016/j.jlamp.2020.100615
Bouwman MLuttik BSchols WWillemse T(2020)A process algebra with global variablesElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.322.5322(33-50)Online publication date: 27-Aug-2020
https://doi.org/10.4204/EPTCS.322.5
Cristescu IGiven-Wilson TLegay A(2020)Expressiveness of concurrent intensionalityTheoretical Computer Science10.1016/j.tcs.2020.05.007Online publication date: May-2020
https://doi.org/10.1016/j.tcs.2020.05.007
Valencia F(2019)Semantic Structures for Spatially-Distributed Multi-Agent SystemsElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.300.3300(39-53)Online publication date: 22-Aug-2019
https://doi.org/10.4204/EPTCS.300.3
Talbot PKomendantskaya E(2019)Spacetime ProgrammingProceedings of the 21st International Symposium on Principles and Practice of Declarative Programming10.1145/3354166.3354183(1-16)Online publication date: 7-Oct-2019
https://dl.acm.org/doi/10.1145/3354166.3354183
Bonchi FBussi LGadducci FSantini F(2019)Polyadic Soft ConstraintsThe Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy10.1007/978-3-030-31175-9_14(241-257)Online publication date: 4-Nov-2019
https://doi.org/10.1007/978-3-030-31175-9_14
Ramírez SRomero MRocha CValencia F(2018)Real-Time Rewriting Logic Semantics for Spatial Concurrent Constraint ProgrammingRewriting Logic and Its Applications10.1007/978-3-319-99840-4_13(226-244)Online publication date: 8-Sep-2018
https://doi.org/10.1007/978-3-319-99840-4_13
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Type-theoretic foundations for concurrent object-oriented programing

Type-theoretic foundations for concurrent object-oriented programing

Soft concurrent constraint programming