M. Gabbrielli and G. Levi. An unfolding reactive semantics for concurrent constraint programming. Technical Report TR ../90, Dipartimento di Informatica, Universit`a di Pisa, Pisa, 1990.

 Home/Search   Document Not in Database   Summary   Related Articles  

This paper is cited in the following contexts:
Algebraic Properties of Idempotent Substitutions - Palamidessi (1996)   (37 citations)  (Correct)

.... to Equational Logic programming (namely, HCL plus some equational theory) see [15] Moreover, it can be generalized to the theory of Constraint Logic Programming, see [14] Finally, when applied to Concurrent Logic Languages, it allows to use an uniform concept of guard [19] 21] 22] 10] [9]. The main disadvantage is that we have, at each step, only an implicit notion of result, in terms of an equation set, and this can lead to useless computations if the consistency check is done only at the end (of the computation) On the other side, the consistency check of an equation set E is ....

M. Gabbrielli and G. Levi. An unfolding reactive semantics for concurrent constraint programming. Technical Report TR ../90, Dipartimento di Informatica, Universit`a di Pisa, Pisa, 1990.

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