Samson Abramsky. Computational interpretations of linear logic. Theoretical Computer Science, 111:3--57, 1993. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Natural Deduction for Intuitionistic Non-Commutative Linear.. - Polakow, Pfenning (1999) (18 citations) (Correct)
No context found.
Samson Abramsky. Computational interpretations of linear logic. Theoretical Computer Science, 111:3--57, 1993.
Natural Deduction for Intuitionistic Non-Commutative Linear.. - Polakow, Pfenning (1999) (18 citations) (Correct)
No context found.
S. Abramsky. Computational interpretations of linear logic. Theoretical Computer Science, 111:3--57, 1993.
A judgmental analysis of linear logic - Bor-Yuh Evan Chang (Correct)
No context found.
Samson Abramsky, Computational interpretations of linear logic, Theoretical Computer Science 111 (1993), 3--57.
Structural Cut Elimination in Linear Logic Frank Pfenning.. - Cmu-Cs- School Of (Correct)
No context found.
Samson Abramsky. Computational interpretations of linear logic. Theoretical Computer Science, 111:3--57, 1993.
A Judgmental Analysis of Linear Logic - Bor-Yuh Evan Chang (2003) (1 citation) (Correct)
No context found.
Samson Abramsky, Computational interpretations of linear logic, Theoretical Computer Science 111 (1993), 3--57.
The Inverse Method for Intuitionistic Linear Logic (The.. - Chaudhuri (2003) (Correct)
No context found.
Samson Abramsky. Computational interpretations of linear logic. Theoretical Computer Science, 111(1&2):3--57, 1993. 22
Typed Memory Management via Static Capabilities - David Walker Carnegie (2000) (24 citations) (Correct)
No context found.
Abramsky, S. 1993. Computational interpretations of linear logic. Theoretical Computer Science 111, 3-57.
Structural Cut Elimination in Linear Logic - Pfenning (1994) (7 citations) (Correct)
No context found.
Samson Abramsky. Computational interpretations of linear logic. Theoretical Computer Science, 111:3--57, 1993.
A Judgmental Analysis Of Linear Logic - Bor-Yuh Evan Chang (2003) (1 citation) (Correct)
No context found.
Samson Abramsky, Computational interpretations of linear logic, Theoretical Computer Science, vol. 111 (1993), pp. 3--57.
Electronic Notes in Computer Science 1 (1995) - On Modal Calculus (1995) (4 citations) (Correct)
No context found.
Samson Abramsky. Computational interpretations of linear logic. Theoretical Computer Science, 111:3--57, 1993.
Type-Directed Concurrency - Deepak Garg And (Correct)
No context found.
S. Abramsky. Computational interpretations of linear logic. Theoretical Computer Science, 111(1--2):3--57, 1993.
CLL: A Concurrent Language Built from Logical Principles - Garg (2005) (Correct)
No context found.
Samson Abramsky. Computational interpretations of linear logic. Theoretical Computer Science, 111(1--2):3--57, 1993.
Sequentiality and the π-Calculus - Berger, Honda, Yoshida (2001) (Correct)
No context found.
Abramsky, S., Computational interpretation of linear logic. TCS, Vol. 111, 1993.
A Judgmental Analysis of Linear Logic - Chang, Chaudhuri, Pfenning (2003) (1 citation) (Correct)
No context found.
Samson Abramsky, Computational interpretations of linear logic, Theoretical Computer Science 111 (1993), 3--57.
Cut Rules and Explicit Substitutions - Vestergaard, Wells (1999) (3 citations) (Correct)
No context found.
Samson Abramsky. Computational interpretations of linear logic. Theoretical Computer Science, 111:3-57, 1993.
Cut Rules and Explicit Substitutions - Vestergaard, Wells (2000) (3 citations) (Correct)
No context found.
Abramsky, S. (1993). Computational interpretations of linear logic. Theoretical Computer Science, 111:3--57.
Constant-Only Multiplicative Linear Logic is NP-Complete - Lincoln, Winkler (1992) (24 citations) (Correct)
No context found.
S. Abramsky. Computational interpretations of linear logic. Theoretical Computer Science, 1991.
Appears in New Generation Computing, 15(4), 1997 - Static Analysis Of (1996) (Correct)
No context found.
S. Abramsky. Computational interpretations of linear logic. Theoretical Computer Science, 111(1--2):3--57, 1993.
Unknown - Linear Logic Programming (Correct)
No context found.
Samson Abramsky. Computational interpretations of linear logic. Theoretical Computer Science, 111:3--57, 1993.
Down With the Bureaucracy of Syntax! - Pattern Matching For (Correct)
No context found.
S. Abramsky, Computational interpretations of linear logic. Theoretical Computer Science, 111:3--57, 1993.
Termination - As The Example (Correct)
No context found.
Samson Abramsky. Computational interpretations of linear logic. Theoretical Computer Science, 111:3--57, 1993.
Unknown - Linear Type Theory (Correct)
No context found.
Samson Abramsky. Computational interpretations of linear logic. Theoretical Computer Science, 111:3--57, 1993.
For the Completness Direction We Need to Generalize the.. - Theorem Completeness Of (Correct)
No context found.
Samson Abramsky. Computational interpretations of linear logic. Theoretical Computer Science, 111:3--57, 1993.
Unknown - Linear Calculus In (Correct)
No context found.
Samson Abramsky. Computational interpretations of linear logic. Theoretical Computer Science, 111:3--57, 1993.
Is There a Use for Linear Logic? - Wadler (1991) (5 citations) (Correct)
No context found.
S. Abramsky, Computational interpretations of linear logic. Preprint, Imperial College, London.
First 50 documents Next 50
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