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
A concurrent logical framework I: Judgments and.. - Watkins, Cervesato.. (2003) (2 citations) (Correct)
....term language, unlike CLF, relies on conversion. There have been many other formalisms proposed for the representation of concurrent systems, many having elements in common with the CLF approach. Abramsky s proofsas processes relates classical linear logic with the synchronous calculus [Abr93, BS94]. Here concurrent computation corresponds to proof normalization (cut elimination) giving the system a functional avor. Concurrent computations (traces) are thus not rei ed as objects, as they are in CLF. Closer to the CLF view are approaches in which logical formulas are identi ed with ....
Samson Abramsky. Computational interpretations of linear logic. Theoretical Computer Science, 111(1-2):3-57, 1993.
Intersection Types and the Linear Lambda-Calculus - Ario Florido And (2001) (Correct)
....type system. Our notion of expansion does not depend on the type derivation. It is a de nition by induction on the terms which can be used as a basis to more speci c term transformation processes. The linear calculus was also studied in a di erent context by the linear logic community [Abr93, LM92, Wad90, BBdH92]. In these works the linear calculus is de ned as the computational interpretation of linear logic and the problem of transforming non linear terms into linear ones is not a central issue. 3 Types Here we describe the type systems used in the rest of the paper. 3.1 Curry Types The Curry ....
S. Abramsky. Computational interpretations of linear logic. Theoretical Computer Science, 1993.
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.
Call-by-Name, Call-by-Value, Call-by-Need, and the Linear.. - Maraist, Odersky, al. (1995) (1 citation) (Correct)
No context found.
S. Abramsky, Computational interpretations of linear logic. Theoretical Computer Science 111:3--57, 1993.
Confidentiality and Integrity with Untrusted Hosts - Steve Zdancewic Andrew (2 citations) (Correct)
No context found.
Samson Abramsky. Computational interpretations of linear logic. Theoretical Computer Science, 111:3-- 57, 1993.
Some Theory and Applications of Linear Logic - Cs Project Report (Correct)
No context found.
Samson Abramsky. Computational interpretations of linear logic. Theoretical Computer Science, 1991.
A Model for Declarative Programming and Specification with.. - Caires (1999) (Correct)
No context found.
S. Abramsky. Computational interpretations of linear logic. Theoretical Computer Science, 111(1-2):3-57, April 1993.
Completeness of Bisimilarity for Contextual Equivalence in Linear.. - Crole (2001) (Correct)
No context found.
S. Abramsky. Computational interpretations of linear logic. Theoretical Computer Science, 111((1-2)):3-57, 1993.
Domain Theory for Concurrency - Nygaard (2003) (1 citation) (Correct)
No context found.
S. Abramsky. Computational interpretations of linear logic. Theoretical Computer Science, 111(1--2):3--57, 1993.
Presheaf Models and Process Calculi - Nygaard (2002) (Correct)
No context found.
S. Abramsky. Computational interpretation of linear logic. Tech. Report 90/20, Dept. of Computing, Imperial College, 1990.
Genericity and the π-Calculus - Berger, Honda, Yoshida (Correct)
No context found.
Abramsky, S. Computational interpretations of linear logic. TCS 111 (1993).
Linearity and the Pi-Calculus - Naoki Kobayashi University (1996) (85 citations) (Correct)
No context found.
Samson Abramsky. Computational interpretations of linear logic. Theoretical Computer Science, 111(1--2):3--57, April 12 1993.
On Bunched Typing - Peter Hearn Department (2002) (Correct)
No context found.
S. Abramsky. Computational interpretations of linear logic. Theoretical Computer Science, 111:3-57, 1993.
Names and Higher-Order Functions - Stark (1995) (29 citations) (Correct)
No context found.
S. Abramsky. Computational interpretations of linear logic. Theoretical Computer Science, 111:3--57, 1993. (p. 125)
Sequentiality and the π-Calculus - Berger, Honda, Yoshida (2001) (Correct)
No context found.
Abramsky, S., Computational interpretation of linear logic. TCS, Vol. 111, 1993.
Completeness of Bisimilarity for Contextual Equivalence in Linear.. - Crole (Correct)
No context found.
S. Abramsky. Computational interpretations of linear logic. Theoretical Computer Science, 111((1--2)):3--57, 1993.
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.
Domain Theory for Concurrency - Glynn (2003) (1 citation) (Correct)
No context found.
S. Abramsky. Computational interpretations of linear logic. Theoretical Computer Science, 111(1--2):3--57, 1993.
Domain Theory for Concurrency - Nygaard (2003) (1 citation) (Correct)
No context found.
S. Abramsky. Computational interpretations of linear logic. Theoretical Computer Science, 111(1--2):3--57, 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.
An Overview of Linear Logic Programming - Dale Miller Inria (Correct)
No context found.
Samson Abramsky. Computational interpretations of linear logic. Theoretical Computer Science, 111: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.
CTL Model-Checking over Logics with Non-Classical Negations - Marsha Chechik Department (2003) (1 citation) (Correct)
No context found.
S. Abramsky. "Computational Interpretations of Linear Logic". Theoretical Computer Science, 111(1-2):3--57, April 1993.
Unknown - Linear Type Theory (Correct)
No context found.
Samson Abramsky. Computational interpretations of linear logic. Theoretical Computer Science, 111:3-57, 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, vol. 111 (1993), pp. 3--57.
How Linear is Howe? - Roy Crole Email (Correct)
No context found.
S. Abramsky. Computational interpretations of linear logic, 1990.
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