(Enter summary)
Abstract: We present a new proof of cut elimination for linear logic which proceeds by three nested structural inductions, avoiding the explicit use of multi-sets and termination measures on sequent derivations. The computational content of this proof is a non-deterministic algorithm for cut elimination which is amenable to an elegant implementation in Elf. We show this implementation in detail. (Update)
Cited by: More
A judgmental analysis of linear logic - Bor-Yuh Evan Chang
(Correct)
Relating Natural Deduction and Sequent Calculus for.. - Polakow, Pfenning (1999)
(Correct)
Using Constrained Intuitionistic Linear Logic for Hybrid.. - Planning Problems Uluc
(Correct)
Similar documents (at the sentence level):
75.7%: Structural Cut Elimination in Linear Logic - Pfenning (1994)
(Correct)
75.5%: Structural Cut Elimination in Linear Logic Frank Pfenning.. - Cmu-Cs- School Of
(Correct)
Active bibliography (related documents): More All
0.6: Structural Cut Elimination - Frank Pfenning (1995)
(Correct)
0.2: A Linear Logical Framework - Cervesato, Pfenning (1996)
(Correct)
0.1: Sequent Calculi - Pfenning (1995)
(Correct)
Similar documents based on text: More All
0.3: Duplication of Directed Graphs and Exponential Blow Up of Proofs - Carbone (1998)
(Correct)
0.2: A Judgmental Analysis of Linear Logic - Chang, Chaudhuri, Pfenning (2003)
(Correct)
0.1: Elf: A Language for Logic Definition and Verified Metaprogramming - Pfenning (1989)
(Correct)
Related documents from co-citation: More All
18: Theoretical Computer Science (context) - Girard - 1987
15: Annals of Pure and Applied Logic (context) - Girard, unity et al. - 1993
12: Mathematical Structures in Computer Science (context) - Pfenning, Davies et al. - 2001
BibTeX entry: (Update)
F. Pfenning. Structural cut elimination in linear logic. Technical Report CMU-CS-94-222, Carnegie Mellon University, Department of Computer Science, December 1994. http://citeseer.ist.psu.edu/article/pfenning94structural.html More
@techreport{ pfenning94structural,
author = "Frank Pfenning",
title = "Structural cut elimination in linear logic",
number = "CMU-CS-94-222",
year = "1994",
url = "citeseer.ist.psu.edu/article/pfenning94structural.html" }
Citations (may not include all citations):
434
A framework for defining logics
- Harper, Honsell et al. - 1993
340
Uniform proofs as a foundation for logic programming (context) - Miller, Nadathur et al. - 1991
233
Computational interpretations of linear logic
- Abramsky - 1993
215
Theoretical Computer Science (context) - Girard - 1987
210
Logic programming in the LF logical framework
- Pfenning - 1991
63
Logic Programming in Intuitionistic Linear Logic: Theory (context) - Hodas - 1994
20
Annals of Pure and Applied Logic (context) - Girard, unity - 1993
20
Logic programming with focusing proofs in linear logic (context) - Andreoli - 1992
17
A structural proof of cut elimination and its representation..
- Pfenning - 1994
15
Automated Proof Search in Non-Classical Logics: Efficient Ma.. (context) - Wallen - 1990
5
Talk given at the Workshop on Logical Frameworks (context) - Miller, Plotkin et al. - 1992
4
Available as Technical Report CRIN 94-R (context) - Galmiche, Perrier et al.
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.cmu.edu/afs/cs/user/fp/www/lfs-bib.html): More
The Occurrence of Continuation Parameters in CPS Terms - Danvy, Pfenning (1995)
(Correct)
A Proof of the Church-Rosser Theorem and its Representation in a .. - Pfenning (1992)
(Correct)
Higher-order syntax with induction in Coq - Despeyroux, Hirschowitz
(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