Joseph C. Vanderwaart and Karl Crary. A simplified account of the metatheory of linear lf. Electronic Notes in Theoretical Computer Science, 70(2), 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A concurrent logical framework I: Judgments and.. - Watkins, Cervesato.. (2003) (2 citations) (Correct)
....freely generated fragment of intuitionistic linear logic [HM94, Bar96] whose proofs admit long normal forms without any commuting conversions. This allows a relatively simple type directed equality checking algorithm which is critical in the proof of decidability of type checking for the framework [CP98, VC00]. While LLF solved many problems associated with the representation of stateful computations, the encoding of concurrent computations remained unsatisfactory. In this report, we demonstrate that the limitations of LLF can be overcome by extending the framework with a monad that incorporates the ....
Joseph C. Vanderwaart and Karl Crary. A simplified account of the metatheory of linear LF. Draft paper, September 2000.
A Concurrent Logical Framework II: Examples and.. - Cervesato, Pfenning.. (2002) (2 citations) (Correct)
....freely generated fragment of intuitionistic linear logic [HM94, Bar96] whose proofs admit long normal forms without any commuting conversions. This allows a relatively simple type directed equality checking algorithm which is critical in the proof of decidability of type checking for the framework [CP98, VC00]. While LLF solved many problems associated with stateful computation, the encoding of concurrent computations remained unsatisfactory. In this report, we demonstrate that the limitations of LLF can be overcome by extending the framework with a monad that incorporates the synchronous ....
Joseph C. Vanderwaart and Karl Crary. A simplified account of the metatheory of linear LF. Draft paper, September 2000.
On Equivalence and Canonical Forms in the LF Type Theory - Harper, Pfenning (2001) (16 citations) (Correct)
....developed a variant of the technique presented here to handle a form of subtyping and singleton kinds. A number of papers subsequent to the original technical report describing our construction [HP99] have clearly demonstrated that the proposed technique is widely applicable. Vanderwaart and Crary [VC01] have adapted the ideas with minor modifications to give a proof of the decidability for linear LF that is stronger than the original one [CP98] since it does not require # long forms from the start. The further adaptation to the case of an ordered linear type theory [Pol01] provides further ....
....precisely so we can prove injectivity of products at an early stage. Note that this is not a restriction from the point of view of our applications: Geuvers and Barendsen [GB99] have shown that LF without family level # abstraction is just as expressive as full LF. However, Vanderwaart and Crary [VC01] have shown that Coquand s technique for handling type level # abstractions can be adapted to our proof by carrying out a separate, second logical relations argument. We suspect that this may be extended to the case of predicative universes, but the impredicative case is likely to require ....
[Article contains additional citation context not shown here]
Joseph C. Vanderwaart and Karl Crary. A simplified account of the metatheory of linear LF. Technical Report CMU-CS-01-154, Carnegie Mellon University, 2001.
Intensionality, Extensionality, and Proof Irrelevance in Modal.. - Pfenning (2001) (Correct)
....judgments are considered primarily as hypotheses. Instead of internalizing them as modal operators, we internalize the corresponding hypothetical judgment as function types. Such a restriction is not new it goes back to similar treatments of linear logic [HM94] and linear type theory [CP98, VC00] with similar motivations. 2 In the remainder of the paper we present our type theory, investigate its properties, and sketch some further developments and potential applications. 2 A Modal Type Theory Our modal type theory is a conservative extension of LF [HHP93] Our approach follows the ....
Joseph C. Vanderwaart and Karl Crary. A simplified account of the metatheory of linear LF. Draft paper, September 2000.
Intensionality, Extensionality, and Proof Irrelevance in Modal.. - Pfenning (2001) (Correct)
....judgments are considered primarily as hypotheses. Instead of internalizing them as modal operators, we internalize the corresponding hypothetical judgment as function types. Such a restriction is not new it goes back to similar treatments of linear logic [HM94] and linear type theory [CP98, VC00] with similar motivations. 2 In the remainder of the paper we present our type theory, investigate its properties, and sketch some further developments and potential applications. 2 A Modal Type Theory Our modal type theory is a conservative extension of LF [HHP93] Our approach follows the ....
Joseph C. Vanderwaart and Karl Crary. A simplified account of the metatheory of linear LF. Draft paper, September 2000.
A Meta Linear Logical Framework - McCreight, Schürmann (2003) (Correct)
No context found.
Joseph C. Vanderwaart and Karl Crary. A simplified account of the metatheory of linear lf. Electronic Notes in Theoretical Computer Science, 70(2), 2002.
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