ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Theoretical Computer Science
Volume 278, Issues 1-2, 6 May 2002, Pages 223-255
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (243 K)

  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/S0304-3975(00)00337-6    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2002 Published by Elsevier Science B.V. All rights reserved.

Truly concurrent constraint programming

V. GuptaCorresponding Author Contact Information, E-mail The Corresponding Author, a, R. JagadeesanE-mail The Corresponding Author, b and V. A. SaraswatE-mail The Corresponding Author, c

a Stratify Inc., 501 Ellis Street, Mountain View, CA 94043, USA b Department of Computer Science, Loyola University Chicago, 6525 N. Sheridan Road, Chicago, IL 60626, USA c 41 Networks, 208 Morris Avenue, Mountain Lakes, NJ 07046, USA

Available online 25 April 2002.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

We study “causality” relationships in Concurrent Constraint Programming: what is observed is not just the conjunction of constraints deposited in the store, but also the causal dependencies between these constraints. We describe a denotational semantics for Image that is fully abstract with respect to observing this “causality” relation on constraints. This semantics preserves more fine-grained structure of computation; in particular the Interleaving Law

(aP)short parallel(bQ)=(a→(Pshort parallel(bQ)))(b→(Qshort parallel(aP)))
is not verified (□ is indeterminate choice). Relationships between such a denotational approach to true concurrency and different powerdomain constructions are explored.


 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.