On a Modal -Calculus for S4 F. Pfenning Carnegie Mellon University...  Home/Search
Context Related
| cmu.edu/~fp/papers/mfps95.ps cmu.edu/Groups/fox/peopl...mfps95.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cmu.edu/~fp/publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present , a concise formulation of a proof term calculus for the intuitionistic modal logic S4 that is well-suited for practical applications. We show that, with respect to provability, it is equivalent to other formulations in the literature, sketch a simple type checking algorithm, and prove subject reduction and the existence of canonical forms for well-typed terms. Applications include a new formulation of natural deduction for intuitionistic linear logic, modal logical frameworks,... (Update)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
F. Pfenning and H.C. Wong, \On a modal lambda-calculus for S4", Electronic Notes in Computer Science 1, 1995. http://citeseer.ist.psu.edu/pfenning95electronic.html More
@misc{ pfenning95electronic,
author = "F. Pfenning and H. Wong and n lambda-calculus",
title = "Electronic Notes in Computer Science",
text = "F. Pfenning and H.C. Wong, \On a modal lambda-calculus for S4, Electronic
Notes in Computer Science 1, 1995.",
year = "1995",
url = "citeseer.ist.psu.edu/pfenning95electronic.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
210 Logic programming in the LF logical framework - Pfenning - 1991
186 Compiling polymorphism using intensional type analysis - Harper, Morrisett - 1995
143 A modal analysis of staged computation - Davies, Pfenning - 1995
116 Natural Deduction (context) - Prawitz - 1965
83 volume 7 of Cambridge Tracts in Theoretical Computer Science (context) - Girard, Lafont et al. - 1989
60 A term calculus for intuitionistic linear logic - Benton, Bierman et al. - 1993
52 Intuitionistic necessity revisited - Bierman, de Paiva - 1992
51 Two-Level Functional Languages (context) - Nielson, Nielson - 1992
46 On Intuitionistic Linear Logic (context) - Bierman - 1993
43 Candidats de R'eductibilit'e (context) - Gallier - 1990
38 A computational interpretation of modal proofs - Martini, Masini - 1994
28 Natural deduction for intuitionistic linear logic - Troelstra - 1993
[Article contains additional citations not shown here]
Documents on the same site (http://www.cs.cmu.edu/~fp/publications.html): More
Verifying Uniqueness in a Logical Framework - Anderson, Pfenning (2004) (Correct)
Compiler Verification in LF - Hannan, Pfenning (1992) (Correct)
Meta-Programming with Names and Necessity - Nanevski, Pfenning (2002) (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