Frank Pfenning. Structural cut elimination I. intuitionistic and classical logic. Information and Computation, 157(1/2):84-141, March 2000. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
Correspondence Assertions for Process Synchronization.. - Bonelli, Compagnoni.. (2003) (3 citations) (Correct)
....by such a restriction and it is not clear whether the technical complications of the meta theory resulting from lifting it outweighs its bene ts. In fact this restriction appears in other settings in which linear and intuitionistic assumptions live together such as the linear logical framework of [4]. The second condition, C2, requires that have no cyclic dependencies. This is usually guaranteed by the representation of environments as sequences of type assumptions, in which an assumption x : U depends only on those appearing to its left. Such a representation seems un t in a setting where ....
Cervesato, I. and F. Pfenning, A linear logical framework, Information and Computation 179 (2002), pp. 19-75.
A Concurrent Logical Framework: The Propositional.. - Watkins, Cervesato.. (2003) (2 citations) Self-citation (Pfenning) (Correct)
No context found.
Frank Pfenning. Structural cut elimination I. intuitionistic and classical logic. Information and Computation, 157(1/2):84-141, March 2000.
A Symmetric Modal Lambda Calculus for Distributed - Computing Tom Murphy Self-citation (Pfenning) (Correct)
No context found.
Frank Pfenning. Structural cut elimination: I. intuitionistic and classical logic. Information and Computation, 157(1-2):84--141, 2000.
A Symmetric Modal Lambda Calculus for Distributed Computing - Tom Murphy Vii (2004) (3 citations) Self-citation (Pfenning) (Correct)
No context found.
Frank Pfenning. Structural cut elimination: I. intuitionistic and classical logic. Information and Computation, 157(12) :84--141, 2000.
A Symmetric Modal Lambda Calculus for Distributed - Computing Tom Murphy (2005) Self-citation (Pfenning) (Correct)
No context found.
Frank Pfenning. Structural cut elimination: I. intuitionistic and classical logic. Information and Computation, 157(1-2):84--141, 2000.
A Linear Logic of Authorization and Knowledge - Garg, Bauer, Bowers.. (2006) Self-citation (Pfenning Logic) (Correct)
No context found.
Frank Pfenning. Structural cut elimination I. Intuitionistic and classical logic. Information and Computation, 157(1/2):84--141, March 2000.
A Concurrent Logical Framework: The Propositional.. - Watkins, Cervesato.. (2003) (2 citations) Self-citation (Pfenning) (Correct)
No context found.
Frank Pfenning. Structural cut elimination I. intuitionistic and classical logic. Information and Computation, 157(1/2):84--141, March 2000.
A Symmetric Modal Lambda Calculus for Distributed Computing - Tom Murphy Vii (2005) (3 citations) Self-citation (Pfenning) (Correct)
No context found.
Frank Pfenning. Structural cut elimination: I. intuitionistic and classical logic. Information and Computation, 157(12) :84--141, 2000.
CLF: A Dependent Logical Framework for Concurrent.. - Watkins, Cervesato.. (2004) (1 citation) Self-citation (Pfenning) (Correct)
No context found.
Frank Pfenning. Structural cut elimination I. intuitionistic and classical logic. Information and Computation, 157(1/2):84--141, March 2000.
A Symmetric Modal Lambda Calculus for Distributed Computing - Tom Murphy Vii (2004) (3 citations) Self-citation (Pfenning) (Correct)
No context found.
Frank Pfenning. Structural cut elimination: I. intuitionistic and classical logic. Information and Computation, 157(12) :84--141, 2000.
A Symmetric Modal Lambda Calculus for Distributed - Computing Tom Murphy Self-citation (Pfenning) (Correct)
No context found.
Frank Pfenning. Structural cut elimination: I. intuitionistic and classical logic. Information and Computation, 157(1-2):84--141, 2000.
A Symmetric Modal Lambda Calculus for Distributed - Computing Tom Murphy Self-citation (Pfenning) (Correct)
No context found.
Frank Pfenning. Structural cut elimination: I. intuitionistic and classical logic. Information and Computation, 157(1-2):84--141, 2000.
Verifying Uniqueness in a Logical Framework - Anderson, Pfenning (2004) (1 citation) Self-citation (Pfenning) (Correct)
No context found.
F. Pfenning. Structural cut elimination I. intuitionistic and classical logic. Information and Computation, 157(1/2):84--141, Mar. 2000.
Type Refinements - Harper, Pfenning (2001) Self-citation (Pfenning Logic) (Correct)
No context found.
Frank Pfenning. Structural cut elimination I. intuitionistic and classical logic. Information and Computation, 157(1/2):84--141, March 2000.
A Symmetric Modal Lambda Calculus for Distributed.. - Murphy VII.. (2004) (3 citations) Self-citation (Pfenning) (Correct)
No context found.
Frank Pfenning. Structural cut elimination: I. intuitionistic and classical logic. Information and Computation, 157(12) :84--141, 2000.
A Symmetric Modal Lambda Calculus for Distributed.. - Murphy VII.. (2004) (3 citations) Self-citation (Pfenning) (Correct)
No context found.
Frank Pfenning. Structural cut elimination: I. intuitionistic and classical logic. Information and Computation, 157(1-2):84--141, 2000.
A Symmetric Modal Lambda Calculus for Distributed Computing - VII, Crary, Harper, Pfenning (2004) (3 citations) Self-citation (Pfenning) (Correct)
No context found.
Frank Pfenning. Structural cut elimination: I. intuitionistic and classical logic. Information and Computation, 157(1-2):84--141, 2000.
Verifying Uniqueness in a Logical Framework - Anderson, Pfenning (2004) (1 citation) Self-citation (Pfenning) (Correct)
No context found.
F. Pfenning. Structural cut elimination I. intuitionistic and classical logic. Information and Computation, 157(1/2):84--141, Mar. 2000.
A Symmetric Modal Lambda Calculus for Distributed Computing - VII, Crary, Harper, Pfenning (2004) (3 citations) Self-citation (Pfenning) (Correct)
No context found.
Frank Pfenning. Structural cut elimination: I. intuitionistic and classical logic. Information and Computation, 157(1-2):84--141, 2000.
A Symmetric Modal Lambda Calculus for Distributed.. - Murphy VII.. (2004) (3 citations) Self-citation (Pfenning) (Correct)
No context found.
Frank Pfenning. Structural cut elimination: I. intuitionistic and classical logic. Information and Computation, 157(12) :84--141, 2000.
A Symmetric Modal Lambda Calculus for Distributed Computing - VII, Crary, Harper, Pfenning (2004) (3 citations) Self-citation (Pfenning) (Correct)
No context found.
Frank Pfenning. Structural cut elimination: I. intuitionistic and classical logic. Information and Computation, 157(12) :84--141, 2000.
A Concurrent Logical Framework: The Propositional.. - Watkins, Cervesato.. (2003) (2 citations) Self-citation (Pfenning) (Correct)
No context found.
Frank Pfenning. Structural cut elimination I. intuitionistic and classical logic. Information and Computation, 157(1/2):84--141, March 2000.
A concurrent logical framework I: Judgments and.. - Watkins, Cervesato.. (2003) (2 citations) Self-citation (Pfenning) (Correct)
....from the proof theoretic point of view) and the expansion operator witnesses the identity principles for typing (the re exivity of entailment) 4. 1 Instantiation The recurrence de ning instantiation is based on the observation, exploited in cut elimination proofs on the logical side [Pfe00], but not so well known on the type theoretic side, that the canonical result of substituting one canonical term into another can be de ned by induction on the type of the term being substituted. Accordingly, the instantiation operators are de ned as a family parameterized over the type of the ....
Frank Pfenning. Structural cut elimination: I. Intuitionistic and classical logic. Information and Computation, 157(1/2):84-141, March 2000.
A concurrent logical framework I: Judgments and.. - Watkins, Cervesato.. (2003) (2 citations) Self-citation (Pfenning) (Correct)
....from the proof theoretic point of view) and the expansion operator witnesses the identity principles for typing (the reflexivity of entailment) 4. 1 Instantiation The recurrence defining instantiation is based on the observation, exploited in cut elimination proofs on the logical side [Pfe00], but not so well known on the type theoretic side, that the canonical result of substituting one canonical term into another can be defined by induction on the type of the term being substituted. Accordingly, the instantiation operators are defined as a family parameterized over the type of the ....
Frank Pfenning. Structural cut elimination: I. Intuitionistic and classical logic. Information and Computation, 157(1/2):84--141, March 2000.
A Coverage Checking Algorithm for LF - Schürmann, Pfenning (2003) (5 citations) Self-citation (Pfenning) (Correct)
....Besides checking the exhaustiveness of definitions, coverage checking is used to verify the correctness of meta theoretic proofs represented as relations. Numerous case studies of this style of verification have been carried out, including cut elimination for classical and intuitionistic logics [17], the Church Rosser theorem for the untyped # calculus [15] and various translations between logical systems (see [16] for an introduction and survey) The running example in this paper is the correctness of bracket abstraction, which is a critical step in the translation from natural deduction ....
F. Pfenning. Structural cut elimination I. intuitionistic and classical logic. Information and Computation, 157(1/2):84--141, Mar. 2000.
First 50 documents
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