See this document in CiteSeerX!

A Non Functional Calculus: Linear Logic and Concurrency (2000)  (Make Corrections)  
Corrado Priami, Ugo Solitro, Cristina Borboni



  Home/Search   Context   Related

 
View or download:
sci.univr.it/~priami/wwwpa...Star.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  sci.univr.it/~priami/Mypapers (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: this paper to an interaction mechanism inspired to the computational behaviour of proof nets, a deduction system of linear logic [7]. In this setting the conclusion of a derivation is the type of the corresponding proof net. The computational mechanism is cut elimination that can only occur between terms with the same type. The relationship between proof nets and processes have already been studied in the literature. Abramsky interprets proof as processes and consider a cut-elimination as... (Update)

Similar documents (at the sentence level):
19.5%:   Functional Features of a Calculus for Logic and Concurrency - Priami, Solitro (2000)   (Correct)

Active bibliography (related documents):   More   All
0.2:   Computational Interpretations of Linear Logic - Abramsky (1993)   (Correct)
0.2:   A Procedure for Automatic Proof Nets Construction - Galmiche, Perrier (1992)   (Correct)
0.1:   Concurrent Constraints in the Fusion Calculus (Extended Abstract) - Victor, Parrow   (Correct)

Similar documents based on text:   More   All
0.4:   Aerial Images Analysis for the Extraction of Geographical.. - Bicego, Dalfini, Murino   (Correct)
0.3:   Authentication Primitives for Refining Protocol Specifications - Bodei, Degano, Focardi   (Correct)
0.3:   An Algebraic Theory of Stochastic Name Passing Calculi - Priami, Riva   (Correct)

BibTeX entry:   (Update)

@misc{ priami-non,
  author = "Corrado Priami and Ugo Solitro and Cristina Borboni",
  title = "A Non Functional Calculus: Linear Logic and Concurrency",
  url = "citeseer.ist.psu.edu/priami00non.html" }
Citations (may not include all citations):
1933   Communication and Concurrency (context) - Milner - 1989  ACM
982   Theoretical Computer Science (context) - Girard - 1987  ACM
854   Information and Computation (context) - Milner, Parrow et al. - 1992  DBLP
410   Mobile ambients - Cardelli, Gordon - 1998  ACM   DBLP
254   Theoretical Computer Science (context) - Berry, Boudol et al. - 1992  ACM
61   The Fusion Calculus: Expressiveness and Symmetry in Mobile P.. - Victor - 1998  DBLP
61   The fusion calculus: Expressiveness and symmetry in mobile p.. - Parrow, Victor - 1998
41   A foundation for higher order concurrent constraint programm.. - Smolka - 1994
28   Coordinating mobile agents via blackboards and access rights (context) - De Nicola, Ferrari et al. - 1997  ACM   DBLP
28   Constraints for free in concurrent computations - Niehren, Muller - 1995
19   Theoretical Computer Science (context) - Abramsky, processes - 1994  ACM
14   A proof theoretical approach to communication (context) - Fu - 1997  ACM   DBLP
12   The type free lambda calculus (context) - Barendregt - 1977
5   A typed calculus based on a fragment of linear logic (context) - Solitro - 1989  ACM
2   Local computation in linear logic (context) - Solitro, Valentini - 1993  DBLP

Documents on the same site (http://www.sci.univr.it/~priami/Mypapers.html):   More
Analysis of Facile Programs: a Case Study - Degano, Priami, Leth, Thomsen (1996)   (Correct)
Understanding Mobile Agents via a non-interleaving .. - Borgia, Degano.. (1996)   (Correct)
Itegrating Behavioural and Performance Analysis with Topology.. - Priami   (Correct)

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