G. Perrier. Concurrent programming in linear logic. Technical Report CRIN 95-R-052, INRIA-Lorraine, 1995.  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 ....

G. Perrier. Concurrent programming in linear logic. Technical Report CRIN 95-R-052, INRIA-Lorraine, 1995.

....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 ....

G. Perrier. Concurrent programming in linear logic. Technical Report CRIN 95-R-052, INRIA-Lorraine, 1995. 20

....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 ....

G. Perrier. Concurrent programming in linear logic. Technical Report CRIN 95-R-052, INRIA-Lorraine, 1995.

....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 ....

G. Perrier. Concurrent programming in linear logic. Technical Report CRIN 95-R-052, INRIA-Lorraine, 1995.

....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 ....

G. Perrier. Concurrent programming in linear logic. Technical Report CRIN 95-R-052, INRIA-Lorraine, 1995.

....managements and thus concurrent programming. After this analysis of the proofs as computations approach, we consider it, in section 5, in a rather dioeerent way, i.e. proof search as computation. Thus we propose a new framework, based on F ILL, that can be viewed as an extension of CPL [31] having some common features with ACL [18] The concurrent computations are described in terms of proof construction from a process calculus, with the logical representation of concepts as communication, parallel composition. The logical system, corresponding to this calculus, can be obtained ....

....j P and we manipulate sequents with the form : Gamma P j Sigma with Gamma and Sigma multisets of processes and P a process. Messages are considered as particular process to obtain a framework where communication is asynchronous. They are represented not only by atomic formulas as in [31] but also by formulas composed with 2 and Omega . The other processes, that are not messages are represented by compound formulas and the sequents are F ILL sequents. 5.3 Basic concepts Let us rst consider the problem of communication. A sender has the form M Omega P , where M is the message ....

[Article contains additional citation context not shown here]

G. Perrier. Concurrent Programming in Linear Logic. Technical Report 95-R-052, CRIN-CNRS, Nancy, March 1995.

....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 ....

G. Perrier. Concurrent programming in linear logic. Technical Report CRIN 95-R-052, INRIALorraine, 1995.

....by showing that, for formulas satisfying a certain simple condition, deductions correspond exactly to transitions between agents. Examples of such correspondences have been proposed for LO [2] and the calculus [20] at the expense of extra logical operators, for concurrent logic programming [23, 14] at the expense of restrictions on the form of proofs, and for Petri nets and a propositional fragment of linear logic [19, 3] One aspect of our correspondence between cc and first order non commutative linear logic is that it does not assume such restrictions. Concurrent constraint programming ....

.... is an interesting logic to study in its own right [27] In particular the development of a phase semantics for NLL should provide in turn new denotational semantics of cc programs that capture finer observable properties of cc computations than the ones currently available [31, 12, 29] Perrier [23] has considered a concurrent language based on linear logic and he proposed a denotational semantics based on the phase semantics, to model the interaction capability of a process. From both viewpoints of proof theory and concurrency, it would be thus worth developping the phase semantics of ....

G. Perrier. Concurrent programming in linear logic. Technical Report CRIN 95-R-052, INRIALorraine, 1995.

....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 ....

G. Perrier. Concurrent programming in linear logic. Technical Report CRIN 95-R-052, INRIA-Lorraine, 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