V.A. Saraswat, R. Jagadeesan, and V. Gupta. Defaut timed concurrent constraint programming. In POPL'95: Proceedings ACM Symposium on Principles of Programming Languages, 1995.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....the phase semantics for proving safety properties of CC programs. Outline of the paper. Section 2 presents a natural extension of CC languages in this context, namely Linear CC (LCC) where the constraint system is axiomatized in linear logic. LCC is an extension of CC, somewhat similar to [3] or [33], but where constraints are consumed by ask agents without dependency maintenance or recomputation. Linear constraint systems have also been proposed in [34] in a higher order setting which will not be considered here. From an operational point of view, LCC extends CC in a fundamental way by ....

V.A. Saraswat, R. Jagadeesan, and V. Gupta. Defaut timed concurrent constraint programming. In POPL'95: Proceedings ACM Symposium on Principles of Programming Languages, 1995.

....the phase semantics for proving safety properties of CC programs. Outline of the paper. Section 2 presents a natural extension of CC languages in this context, namely Linear CC (LCC) where the constraint system is axiomatized in linear logic. LCC is an extension of CC, somewhat similar to [3] or [33], but where constraints are consumed by ask agents without dependency maintenance or recomputation. Linear constraint systems have also been proposed in [34] in a higher order setting which will not be considered here. From an operational point of view, LCC extends CC in a fundamental way by ....

V.A. Saraswat, R. Jagadeesan, and V. Gupta. Defaut timed concurrent constraint programming. In POPL'95: Proceedings ACM Symposium on Principles of Programming Languages, 1995.

....of CC languages in this context, namely Linear CC (LCC) where the constraint system is axiomatized in linear logic. Linear constraint systems have been proposed in [24] in a higher order setting which will not be considered here. LCC is a non monotonic extension of CC, somewhat similar to [2] or [23], but where constraints are consumed by ask agents without dependency maintenance or recomputation. From an operational point of view, LCC extends CC in a fundamental way by introducing some forms of imperative programming, particularly useful for reactive systems. Classical CC programs can ....

V.A. Saraswat, R. Jagadeesan, and V. Gupta. Defaut timed concurrent constraint programming. In POPL'95: Proceedings ACM Symposium on Principles of Programming Languages, 1995.

....the phase semantics for proving safety properties of CC programs. Outline of the paper. Section 2 presents a natural extension of CC languages in this context, namely Linear CC (LCC) where the constraint system is axiomatized in linear logic. LCC is an extension of CC, somewhat similar to [3] or [30], but where constraints are consumed by ask agents without dependency maintenance or recomputation. Linear constraint systems have also been proposed in [31] in a higher order setting which will not be considered here. From an operational point of view, LCC extends CC in a fundamental way by ....

V.A. Saraswat, R. Jagadeesan, and V. Gupta. Defaut timed concurrent constraint programming. In POPL'95: Proceedings ACM Symposium on Principles of Programming Languages, 1995.

No context found.

V.A. Saraswat, R. Jagadeesan, and V. Gupta. Defaut timed concurrent constraint programming. In POPL'95: Proceedings ACM Symposium on Principles of Programming Languages, 1995.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC