N. Kobayashi and A. Yonezawa. Logical, testing and observation equivalence for processes in a linear logic programming. Technical Report 93-4, Department of Computer Science, University of Tokyo, 1993. 16  Home/Search   Document Not in Database   Summary   Related Articles   Check

....Logic Programming paradigm, 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 ....

N. Kobayashi and A. Yonezawa. Logical, testing and observation equivalence for processes in a linear logic programming. Technical Report 93-4, Department of Computer Science, University of Tokyo, 1993. 16

....Logic Programming paradigm, 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 ....

N. Kobayashi and A. Yonezawa. Logical, testing and observation equivalence for processes in a linear logic programming. Technical Report 93-4, Department of Computer Science, University of Tokyo, 1993.

....paradigm in a broad sense, that identifies programs as formulas and execution as proof search. This paradigm was applied to linear logic with the notion of uniform proofs [23, 12] and focusing proofs [1] and further works on the design of concurrent languages based on proof search in LL [16, 27]. However our approach is analytical in that we study an existing programming language CC, and model CC computations in a fragment of LL. On the other hand we model properties of infinite CC computations through the observation of accessible stores which has no counterpart in the uniform proofs ....

N. Kobayashi and A. Yonezawa. Logical, testing and observation equivalence for processes in a linear logic programming. Technical Report 93-4, Department of Computer Science, University of Tokyo, 1993.

....paradigm in a broad sense, 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 ....

N. Kobayashi and A. Yonezawa. Logical, testing and observation equivalence for processes in a linear logic programming. Technical Report 93-4, Department of Computer Science, University of Tokyo, 1993.

....paradigm in a broad sense, that identi es programs as formulas and execution as proof search. This paradigm was applied to linear logic with the notion of uniform proofs [23, 12] and focusing proofs [1] and further works on the design of concurrent languages based on proof search in LL [16, 27]. However our approach is analytical in that we study an existing programming language CC, and model CC computations in a fragment of LL. On the other hand we model properties of in nite CC computations through the observation of accessible stores which has no counterpart in the uniform proofs ....

N. Kobayashi and A. Yonezawa. Logical, testing and observation equivalence for processes in a linear logic programming. Technical Report 93-4, Department of Computer Science, University of Tokyo, 1993.

....paradigm in a broad sense, that identifies programs as formulas and execution as proof search. This paradigm was applied to linear logic with the notion of uniform proofs [17, 8] and focusing proofs [1] and further works on the design of concurrent languages based on proof search in LL [12, 19]. However our approach is analytical in that we study an existing programming language CC, and model CC computations in a fragment of LL. On the other hand we model properties of infinite CC computations through the observation of accessible stores which has no counterpart in the uniform proofs ....

N. Kobayashi and A. Yonezawa. Logical, testing and observation equivalence for processes in a linear logic programming. Technical Report 934, Department of Computer Science, University of Tokyo, 1993.

....proposed for Petri nets and a propositional fragment of linear logic [17] for LO [1] and the calculus [19] at the expense of extra logical operators. It suggests also an investigation of the usual semantics of concurrency, specifically that of (bi)simulations in the light of proof theory as in [13, 18]. Another perspective is the study the execution of (L)CC agents in the syntax of proof nets (which is intrinsically parallel, thus naturally more suited for the representation of concurrent computations than are sequent calculi) as in [23] ....

N. Kobayashi and A. Yonezawa. Logical, testing and observation equivalence for processes in a linear logic programming. Technical Report 93-4, Department of Computer Science, University of Tokyo, 1993.

....of concurrent conputations than are sequent calculi) The equivalence result between lcc transitions and INLL deductions suggests also a study of the usual semantics of concurrency, and specifically that of bisimulations, in the light of proof theory. The paper of Kobayashi and Yonezawa [13] is one of the most interesting works done so far to compare bisimulations to a logical semantics. We believe the strong correspondence between logic and concurrent agents established in the paper should encourage further investigation in this cross fertilizating direction. The comparison of the ....

N. Kobayashi and A. Yonezawa. Logical, testing and observation equivalence for processes in a linear logic programming. Technical Report 93-4, Dep. of Comp. Science, University of Tokyo, 1993.

....paradigm in a broad sense, that identifies programs as formulas and execution as proof search. This paradigm was applied to linear logic with the notion of uniform proofs [22, 12] and focusing proofs [1] and further works on the design of concurrent languages based on proof search in LL [16, 25]. However our approach is analytical in that we study an existing programming language CC, and model CC computations in a fragment of LL. On the other hand we model properties of infinite CC computations through the observation of accessible stores which has no counterpart in the uniform proofs ....

N. Kobayashi and A. Yonezawa. Logical, testing and observation equivalence for processes in a linear logic programming. Technical Report 93-4, Department of Computer Science, University of Tokyo, 1993.

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