Aleksandar Nanevski, Frank Pfenning, Brigitte Pientka  Home/Search
Context
Related
| cmu.edu/~fp/papers/cmtt05.ps 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: this paper we investigate the consequences of relativizing these concepts to explicitly specified contexts. We obtain contextual modal logic and its type-theoretic analogue. Contextual modal type theory provides an elegant, uniform foundation for understanding meta-variables and explicit substitutions. We sketch some applications in functional programming and logical frameworks (Update)
Similar documents based on text:
5.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ nanevski-contextual,
author = "Aleksandar Nanevski and Frank Pfenning and Brigitte Pientka",
title = "Contextual Model Type Theory",
url = "citeseer.ist.psu.edu/nanevski05contextual.html" }
Citations (may not include all citations):257 Logic programming in a fragment of intuitionistic linear log.. - Hodas, Miller - 1994
251 A logic programming language with lambda-abstraction - Miller - 1991
176 Notes on formalizing contexts - McCarthy - 1993
143 A modal analysis of staged computation - Davies, Pfenning - 2001
136 System description: Twelf - a meta-logical framework for ded.. - Pfenning, Sch - 1999
133 Multi-stage programming with explicit annotations - Taha, Sheard - 1997
121 Prolegomena to a theory of mechanized formal reasoning (context) - Weyhrauch - 1979
92 Explicit substitutions - Abadi, Cardelli et al. - 1990
90 A linear logical framework - Cervesato, Pfenning - 2002
80 A temporal logic approach to binding-time analysis - Davies - 1996
65 The implementation of ALF -- a proof editor based on Martin-.. - Magnusson - 1995
61 Higher-order unification via explicit substitutions - Dowek, Hardin et al. - 1995
49 Generality in artificial intelligence - McCarthy - 1987
44 The proof theory and semantics of intuitionistic modal logic (context) - Simpson - 1994
42 A completeness theorem in modal logic (context) - Kripke - 1959
[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