Frank Pfenning and Rowan Davies. A judgmental reconstruction of modal logic. Mathematical Structures in Computer Science, 11:511-540, 2001. Notes to an invited talk at the Workshop on Intuitionistic Modal Logics and Applications (IMLA'99), Trento, Italy, July 1999. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
A Concurrent Logical Framework: The Propositional.. - Watkins, Cervesato.. (2003) (2 citations) Self-citation (Pfenning) (Correct)
No context found.
Frank Pfenning and Rowan Davies. A judgmental reconstruction of modal logic. Mathematical Structures in Computer Science, 11:511-540, 2001. Notes to an invited talk at the Workshop on Intuitionistic Modal Logics and Applications (IMLA'99), Trento, Italy, July 1999.
A Concurrent Logical Framework: The Propositional.. - Watkins, Cervesato.. (2003) (2 citations) Self-citation (Pfenning) (Correct)
No context found.
Frank Pfenning and Rowan Davies. A judgmental reconstruction of modal logic. Mathematical Structures in Computer Science, 11:511--540, 2001. Notes to an invited talk at the Workshop on Intuitionistic Modal Logics and Applications (IMLA'99), Trento, Italy, July 1999.
CLF: A Dependent Logical Framework for Concurrent.. - Watkins, Cervesato.. (2004) (1 citation) Self-citation (Pfenning) (Correct)
No context found.
Frank Pfenning and Rowan Davies. A judgmental reconstruction of modal logic. Mathematical Structures in Computer Science, 11:511--540, 2001. Notes to an invited talk at the Workshop on Intuitionistic Modal Logics and Applications (IMLA'99), Trento, Italy, July 1999.
Unknown - Linear Logic Programming Self-citation (Logic) (Correct)
No context found.
Frank Pfenning and Rowan Davies. A judgmental reconstruction of modal logic. Mathematical Structures in Computer Science, 11:511-- 540, 2001. Notes to an invited talk at the Workshop on Intuitionistic Modal Logics and Applications (IMLA'99), Trento, Italy, July 1999.
Type Refinements - Harper, Pfenning (2001) Self-citation (Pfenning Logic) (Correct)
No context found.
Frank Pfenning and Rowan Davies. A judgmental reconstruction of modal logic. Mathematical Structures in Computer Science, 11:511--540, 2001. Notes to an invited talk at the Workshop on Intuitionistic Modal Logics and Applications (IMLA'99), Trento, Italy, July 1999.
Unknown - Linear Type Theory Self-citation (Logic) (Correct)
No context found.
Frank Pfenning and Rowan Davies. A judgmental reconstruction of modal logic. Mathematical Structures in Computer Science, 11:511-- 540, 2001. Notes to an invited talk at the Workshop on Intuitionistic Modal Logics and Applications (IMLA'99), Trento, Italy, July 1999.
For the Completness Direction We Need to Generalize the.. - Theorem Completeness Of Self-citation (Logic) (Correct)
No context found.
Frank Pfenning and Rowan Davies. A judgmental reconstruction of modal logic. Mathematical Structures in Computer Science, 11:511-- 540, 2001. Notes to an invited talk at the Workshop on Intuitionistic Modal Logics and Applications (IMLA'99), Trento, Italy, July 1999.
Unknown - Sequent Calculus In Self-citation (Logic) (Correct)
No context found.
Frank Pfenning and Rowan Davies. A judgmental reconstruction of modal logic. Mathematical Structures in Computer Science, 11:511{ 540, 2001. Notes to an invited talk at the Workshop on Intuitionistic Modal Logics and Applications (IMLA'99), Trento, Italy, July 1999.
CLF: A Dependent Logical Framework for Concurrent.. - Watkins, Cervesato.. (2004) (1 citation) Self-citation (Pfenning) (Correct)
No context found.
Frank Pfenning and Rowan Davies. A judgmental reconstruction of modal logic. Mathematical Structures in Computer Science, 11:511--540, 2001. Notes to an invited talk at the Workshop on Intuitionistic Modal Logics and Applications (IMLA'99), Trento, Italy, July 1999.
A Concurrent Logical Framework: The Propositional.. - Watkins, Cervesato.. (2003) (2 citations) Self-citation (Pfenning) (Correct)
No context found.
Frank Pfenning and Rowan Davies. A judgmental reconstruction of modal logic. Mathematical Structures in Computer Science, 11:511--540, 2001. Notes to an invited talk at the Workshop on Intuitionistic Modal Logics and Applications (IMLA'99), Trento, Italy, July 1999.
Unknown - Linear Logic Programming Self-citation (Logic) (Correct)
No context found.
Frank Pfenning and Rowan Davies. A judgmental reconstruction of modal logic. Mathematical Structures in Computer Science, 11:511{ 540, 2001. Notes to an invited talk at the Workshop on Intuitionistic Modal Logics and Applications (IMLA'99), Trento, Italy, July 1999.
Unknown - Linear Type Theory Self-citation (Logic) (Correct)
No context found.
Frank Pfenning and Rowan Davies. A judgmental reconstruction of modal logic. Mathematical Structures in Computer Science, 11:511{ 540, 2001. Notes to an invited talk at the Workshop on Intuitionistic Modal Logics and Applications (IMLA'99), Trento, Italy, July 1999.
Unknown - Linear Natural Deduction Self-citation (Reconstruction Logic) (Correct)
No context found.
Frank Pfenning and Rowan Davies. A judgmental reconstruction of modal logic. Mathematical Structures in Computer Science, 11:511{ 540, 2001. Notes to an invited talk at the Workshop on Intuitionistic Modal Logics and Applications (IMLA'99), Trento, Italy, July 1999.
A Concurrent Logical Framework: the - Propositional Fragment Kevin Self-citation (Pfenning) (Correct)
....prior notions conservatively. This property of the method should not be underestimated, because it means that all encodings already devised for LF or LLF remain adequate, and their adequacy proofs can remain exactly the same We write fAg for the monad type, which in lax logic would be written A [PD01]. But which types should be available inside the monad They must be expressive enough to represent the state after a computation step in the concurrent object language. This is most naturally represented by the multiplicative conjunction . Then our transition rule can be written 00 k : p ....
....on whether the head variable of R is or is not x. Cases for some syntactic constructs have been omitted; these are all given by similar composition laws. It remains to de ne the substitution into monadic expressions E. Following prior work on proof term assignments for the monadic connectives [PD01], we use leftist substitutions which are syntax directed based on the object at the left of the substitution, rather than the rightist substitutions considered above. The recurrences for substitution into expressions and the leftist substitutions are as follows. R = fE g : fS g and ....
[Article contains additional citation context not shown here]
Frank Pfenning and Rowan Davies. A judgmental reconstruction of modal logic. Mathematical Structures in Computer Science, 11:511-540, 2001. Notes to an invited talk at the Workshop on Intuitionistic Modal Logics and Applications (IMLA'99), Trento, Italy, July 1999.
Unknown - Proof Search Linear Self-citation (Logic) (Correct)
No context found.
Frank Pfenning and Rowan Davies. A judgmental reconstruction of modal logic. Mathematical Structures in Computer Science, 11:511{ 540, 2001. Notes to an invited talk at the Workshop on Intuitionistic Modal Logics and Applications (IMLA'99), Trento, Italy, July 1999.
Unknown - Sequent Calculus In Self-citation (Logic) (Correct)
No context found.
Frank Pfenning and Rowan Davies. A judgmental reconstruction of modal logic. Mathematical Structures in Computer Science, 11:511{ 540, 2001. Notes to an invited talk at the Workshop on Intuitionistic Modal Logics and Applications (IMLA'99), Trento, Italy, July 1999.
For the Completness Direction We Need to Generalize the.. - Theorem Completeness Of Self-citation (Logic) (Correct)
No context found.
Frank Pfenning and Rowan Davies. A judgmental reconstruction of modal logic. Mathematical Structures in Computer Science, 11:511{ 540, 2001. Notes to an invited talk at the Workshop on Intuitionistic Modal Logics and Applications (IMLA'99), Trento, Italy, July 1999.
Unknown - Sequent Calculus In Self-citation (Logic) (Correct)
No context found.
Frank Pfenning and Rowan Davies. A judgmental reconstruction of modal logic. Mathematical Structures in Computer Science, 11:511{ 540, 2001. Notes to an invited talk at the Workshop on Intuitionistic Modal Logics and Applications (IMLA'99), Trento, Italy, July 1999.
Optimizing Higher-Order Pattern Unification - Pientka, Pfenning (2003) (1 citation) Self-citation (Pfenning) (Correct)
....4 we discuss experimental results. Related work is discussed in Section 5. 2 A modal foundation for typed existential variables 2.1 Motivation We start by presenting a foundation for dependently typed existential variables based on modal logic. Following the methodology of Pfenning and Davies [14], we can assign constructive explanations to modal operators. A key characteristic of this view, is to distinguish between propositions that are true and propositions that are valid. A proposition is valid if its truth does not depend on the truth of any other propositions. This leads to the basic ....
Frank Pfenning and Rowan Davies. A judgmental reconstruction of modal logic. Mathematical Structures in Computer Science, 11:511--540, 2001. Notes to an invited talk at the Workshop on Intuitionistic Modal Logics and Applications (IMLA'99), Trento, Italy, July 1999.
Termination - As The Example (Correct)
No context found.
Frank Pfenning and Rowan Davies. A judgmental reconstruction of modal logic. Mathematical Structures in Computer Science, 11:511-- 540, 2001. Notes to an invited talk at the Workshop on Intuitionistic Modal Logics and Applications (IMLA'99), Trento, Italy, July 1999.
Unknown - Linear Calculus In (Correct)
No context found.
Frank Pfenning and Rowan Davies. A judgmental reconstruction of modal logic. Mathematical Structures in Computer Science, 11:511-- 540, 2001. Notes to an invited talk at the Workshop on Intuitionistic Modal Logics and Applications (IMLA'99), Trento, Italy, July 1999.
If ; ; =) A + then ; =) A. - If Then Proof (Correct)
No context found.
Frank Pfenning and Rowan Davies. A judgmental reconstruction of modal logic. Mathematical Structures in Computer Science, 11:511{ 540, 2001. Notes to an invited talk at the Workshop on Intuitionistic Modal Logics and Applications (IMLA'99), Trento, Italy, July 1999.
Unknown - Linear Calculus In (Correct)
No context found.
Frank Pfenning and Rowan Davies. A judgmental reconstruction of modal logic. Mathematical Structures in Computer Science, 11:511{ 540, 2001. Notes to an invited talk at the Workshop on Intuitionistic Modal Logics and Applications (IMLA'99), Trento, Italy, July 1999.
Linear Type Checking - The Typing Rules (Correct)
No context found.
Frank Pfenning and Rowan Davies. A judgmental reconstruction of modal logic. Mathematical Structures in Computer Science, 11:511{ 540, 2001. Notes to an invited talk at the Workshop on Intuitionistic Modal Logics and Applications (IMLA'99), Trento, Italy, July 1999.
Termination - As The Example (Correct)
No context found.
Frank Pfenning and Rowan Davies. A judgmental reconstruction of modal logic. Mathematical Structures in Computer Science, 11:511{ 540, 2001. Notes to an invited talk at the Workshop on Intuitionistic Modal Logics and Applications (IMLA'99), Trento, Italy, July 1999.
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