(Enter summary)
Abstract: We detail Abramsky's "proofs-as-processes" paradigm for interpreting
classical linear logic (CLL) [13] into a "synchronous" version
of the -calculus recently proposed by Milner [27, 28]. The translation
is given at the abstract level of proof structures. We give a
detailed treatment of information flow in proof-nets and show how
to mirror various evaluation strategies for proof normalization. We
also give Soundness and Completeness results for the process-calculus
translations of various... (Update)
Context of citations to this paper: More
...of) LL into stark relief. It has been noted that LL often has little to do with logic and much to do with plugging (see e.g. Bellin and Scott (1994)) In a sense, this paper takes the plugging approach to an extreme, by banishing logic to the background. 2 AGENTS, PORTS...
.... ;#; g (i.e. replicated and linear nodes can be mixed) Diverse structures would be embeddable in this extension, including full proof nets [8]. The status of strong reduction would become subtle in this setting, cf. 15] Second order and Other Extensions Can the presented...
Cited by: More
Strong Normalisation in the π-Calculus - Yoshida, Berger, Honda (2001)
(Correct)
The Algebraic Theory of Interaction Nets - Banach (1995)
(Correct)
Active bibliography (related documents): More All
4.2: On the pi-Calculus and Linear Logic - Bellin, Scott (1994)
(Correct)
0.3: Labelled Deduction - Basin, D'Agostino, Gabbay, Matthews, .. (2000)
(Correct)
0.3: Yet another correctness criterion for Multiplicative Linear.. - Asperti, Dore (1994)
(Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.3: Chu's construction: A proof-theoretic approach - Bellin (1999)
(Correct)
0.2: Cut-Elimination for Full Intuitionistic Linear Logic - Braüner, de Paiva
(Correct)
0.2: A Classical Linear λ-calculus - Bierman (1997)
(Correct)
Related documents from co-citation: More All
6: Interaction Nets (context) - Lafont - 1990
5: Computational interpretations of linear logic
- Abramsky - 1993
5: Girard, J-Y. 1987. `Linear Logic'. In: Theoretical Computer Science 59, pp1-102.
BibTeX entry: (Update)
G. Bellin and P. J. Scott. On the pi-calculus and linear logic. Manuscript, 1992. http://citeseer.ist.psu.edu/bellin94picalculus.html More
@article{ bellin94picalculus,
author = "Gianluigi Bellin and Philip J. Scott",
title = "On the pi-Calculus and Linear Logic",
journal = "Theoretical Computer Science",
volume = "135",
number = "1",
pages = "11-65",
year = "1994",
url = "citeseer.ist.psu.edu/bellin94picalculus.html" }
Citations (may not include all citations):
982
Theoretical Computer Science (context) - Girard, Scedrov et al. ACM
982
Theoretical Computer Science (context) - Girard - 1987 ACM
982
Theoretical Computer Science (context) - Blute, coherence - 1993 ACM
233
Computational Interpretations of Linear Logic
- Abramsky - 1993 ACM DBLP
133
Cambridge Tracts in Theoretical Computer Science (context) - Girard, Lafont et al. - 1989
76
The polyadic -Calculus: a tutorial
- Milner - 1993
69
Geometry of Interaction I: Interpretation of system F (context) - Girard - 1989
68
Towards a Geometry of Interaction (context) - Girard - 1989
53
Center for the Study of Language and Information (context) - Troelstra, Linear et al.
49
Annals of Pure and Applied Logic (context) - Blass, semantics et al. - 1992
42
Linear logic without boxes
- Gonthier, Abadi et al. - 1992 DBLP
31
The Structure of Multiplicatives (context) - Danos, Regnier - 1989
23
University of Edinburgh (context) - Milner, -Calculus et al. - 1992
17
Turing Award Lecture (context) - Milner - 1992 ACM
17
Proofs-as-processes (context) - Abramsky - 1992
16
Mechanizing Proof Theory: Resource-Aware Logics and Proof-Tr.. (context) - Bellin - 1990
13
Some Results on the Interpretation of -calculus in Operator .. (context) - Malacaria, Regnier - 1991
13
Proof Nets for Multiplicative and Additive Linear Logic (context) - Bellin - 1991
12
La logique lin'eaire appliqu'ee `a l (context) - Danos - 1990
11
Geometry of Interaction 2: Deadlock-free Algorithms (context) - Girard - 1990 ACM DBLP
9
Causal Dependencies in Multiplicative Linear Logic with MIX (context) - Asperti
5
Linear Logic and Parallelism (context) - Girard - 1987 ACM DBLP
4
Proof Nets and Typed Lambda Calculus (context) - Bellin, Wiele
2
Logic and Computation (context) - Monteiro, as et al. ACM
2
ese de doctorat, U. Paris VII, Math (context) - Regnier, r'eseaux - 1992
2
Personal notes (context) - Milner
2
ese de doctorat, U. Paris VII, Math (context) - Retor'e, S'equents - 1993
2
to appear in: Proceedings of NATO Advanced Study Institute (context) - Milner, the - 1993
2
Games and Full Completeness Theorem for Multiplicative Linea.. (context) - Abramsky, Jagadeesan
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://profs.sci.univr.it/~bellin/papers.html): More
Subnets of Proof-nets in MLL- - Bellin, Wiele (1994)
(Correct)
Planar and Braided Proof-Nets for Multiplicative Linear Logic .. - Bellin, Fleury (1997)
(Correct)
Chu's construction: A proof-theoretic approach - Bellin (1999)
(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