C. Faggian. Proof construction and non-commutativity: a cluster calculus. In International Conference on Principles and Practice of Declarative Programming, PPDP 2000, 2000. ACM Press. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Precise Logical Semantics of Concurrent Constraint Programs - Soliman (Correct)
....that identi es programs as formulae and execution asproof search. This paradigm has been previously applied to linear logic with the notion of uniform proofs [16, 12] and focusing proofs [1] as well as to the design of concurrent languages based on proof search in LL [2, 20, 14, 18] or in NL [19, 11]. However our approach is analytical in that we study an existing programming language CC, and model CC computations in a fragment of LL or NL. Moreover we model properties of in nite CC computations through the observation of accessible stores which have no counterpart in the language design ....
C. Faggian. Proof construction and non-commutativity: a cluster calculus. In Proceedings of PPDP'00, International Conference on Principles and Practice of Declarative Programming, Montreal, 2000. ACM Publishing Company.
A Precise Logical Semantics of Concurrent Constraint Programs - Fages, Soliman (Correct)
....that identi es programs as formulae and execution as proofsearch. This paradigm has been previously applied to linear logic with the notion of uniform proofs [16, 12] and focusing proofs [1] as well as to the design of concurrent languages based on proof search in LL [2, 20, 14, 18] or in NL [19, 11]. However our approach is analytical in that we study an existing programming language CC, and model CC computations in a fragment of LL or NL. Moreover we model properties of in nite CC computations through the observation of accessible stores which have no counterpart in the language design ....
C. Faggian. Proof construction and non-commutativity: a cluster calculus. In Proceedings of PPDP'00, International Conference on Principles and Practice of Declarative Programming, Montreal, 2000. ACM Publishing Company.
The Linear Logic Semantics of Concurrent Constraint Programs.. - Fages, Soliman (Correct)
....that identi es programs as formulae and execution as proofsearch. This paradigm has been previously applied to linear logic with the notion of uniform proofs [15, 11] and focusing proofs [1] as well as to the design of concurrent languages based on proof search in LL [2, 20, 14, 18] or in NL [19, 9]. However our approach is analytical in that we study an existing programming language CC, and model CC computations in a fragment of LL or NL. Moreover we model properties of in nite CC computations through the observation of accessible stores which have no counterpart in the language design ....
C. Faggian. Proof construction and non-commutativity: a cluster calculus. In Proceedings of PPDP'00, International Conference on Principles and Practice of Declarative Programming, Montreal, 2000. ACM Publishing Company.
Connection-Based Proof Construction in Non-Commutative Logic - Galmiche, Notin (Correct)
No context found.
C. Faggian. Proof construction and non-commutativity: a cluster calculus. In International Conference on Principles and Practice of Declarative Programming, PPDP 2000, 2000. ACM Press.
Constraint Based Proof Construction in Non-Commutative Logic - Jean-Marc Andreoli Roberto (2001) (Correct)
No context found.
C. Faggian. Proof construction and non-commutativity: a cluster calculus. In Proc. Int. Conf. on Principles and Practice of Declarative Programming. ACM Press, 2000.
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