Truly Concurrent Constraint Programming

DMCA

Truly Concurrent Constraint Programming (1996)

Cached

Download Links

[www.math.luc.edu]
[www-cs-students.stanford.edu]

Other Repositories/Bibliography

DBLP

by Vineet Gupta , Radha Jagadeesan , Vijay Saraswat

Venue:	CONCUR96 – Concurrency Theory, volume 1119 of LNCS
Citations:	7 - 1 self

BibTeX

@INPROCEEDINGS{Gupta96trulyconcurrent,
    author = {Vineet Gupta and Radha Jagadeesan and Vijay Saraswat},
    title = {Truly Concurrent Constraint Programming},
    booktitle = {CONCUR96 – Concurrency Theory, volume 1119 of LNCS},
    year = {1996},
    pages = {223--255}
}

OpenURL

Abstract

. Concurrent Constraint Programming (CCP) is a powerful computation model for concurrencyobtained by internalizing the notion of computation via deduction over (first-order) systems of partial information (constraints). In [SRP91] a semantics for indeterminate CCP was given via sets of bounded trace operators; this was shown to be fully abstract with respect to observing all possible quiescent stores (= final states) of the computation. Bounded trace operators constitute a certain class of (finitary) "invertible" closure operators over a downward closed sublattice. Theycanbe thought of as generated via the grammar: t ::= c j c ! t j ct where c ranges over primitive constraints, is conjunction and ! intuitionistic implication. We motivate why it is interesting to consider as observable a "causality" relation on the store: what is observed is not just the conjunction of constraints deposited in the store, but also the causal dependencies between these constraints --- what constraints w...

Keyphrases

concurrent constraint programming certain class powerful computation model theycanbe thought causality relation partial information final state intuitionistic implication trace operator primitive constraint indeterminate ccp possible quiescent store invertible closure operator downward closed sublattice bounded trace operator

DMCA