(Enter summary)
Abstract: We report on work in progress regarding a foundation for
the notion of meta-variable in logical frameworks and type theories. Our
proposal is to treat meta-variables as modal variables in a modal type
theory, which is logically clean and justifies several low-level implementation
techniques for meta-variables. We also speculate on other logical
extensions of our modal type theory, at present without clear applications. (Update)
Cited by: More
Contextual Model Type Theory - Nanevski, Pfenning, Pientka (2005)
(Correct)
Staged Computation with Names and Necessity - Nanevski, Pfenning (2005)
(Correct)
Wobbly Types: Type Inference for Generalised Algebraic Data .. - Jones, Washburn, Weirich (2004)
(Correct)
Similar documents (at the sentence level):
18.8%: A Modal Foundation for Meta-Variables - Aleksandar Nanevski Brigitte (2003)
(Correct)
14.8%: Optimizing Higher-Order Pattern Unification - Pientka, Pfenning (2003)
(Correct)
Active bibliography (related documents): More All
0.6: Small proof witnesses for LF - Sarkar, Pientka, Crary (2005)
(Correct)
0.2: Replace This - Le With Prentcsmacro (2006)
(Correct)
0.1: A Coverage Checking Algorithm for LF - Schürmann, Pfenning (2003)
(Correct)
Similar documents based on text: More All
0.3: Termination and Reduction Checking in the Logical Framework - Pientka, Pfenning (2000)
(Correct)
0.3: Automating inductive Specification Proofs in NuPRL - Pientka, Kreitz (1998)
(Correct)
0.2: Meta-Programming with Names and Necessity - Nanevski, Pfenning (2002)
(Correct)
Related documents from co-citation: More All
2: Modal types as staging specifications for run-time code generation
- Wickline, Lee et al. - 1998
2: Syntactical treatment of modalities (context) - Montague - 1963
2: Ml-like inference for classifiers
- Calcagno, Moggi et al. - 2004
BibTeX entry: (Update)
Aleksandar Nanevski, Brigitte Pientka, and Frank Pfenning. A modal foundation for meta-variables. In Proceedings of MERLIN'03, Uppsala, Sweden, pages 159-- 170, 2003. http://citeseer.ist.psu.edu/article/nanevski03modal.html More
@misc{ nanevski03modal,
author = "A. Nanevski and B. Pientka and F. Pfenning",
title = "A modal foundation for meta-variables",
text = "Aleksandar Nanevski, Brigitte Pientka, and Frank Pfenning. A modal foundation
for meta-variables. In Proceedings of MERLIN'03, Uppsala, Sweden, pages
159-- 170, 2003.",
year = "2003",
url = "citeseer.ist.psu.edu/article/nanevski03modal.html" }
Citations (may not include all citations):
434
A framework for defining logics
- Harper, Honsell et al. - 1993
174
A unification algorithm for typed #-calculus (context) - Huet - 1975
84
Mathematical Structures in Computer Science (context) - Pfenning, Davies et al. - 2001
70
the meanings of the logical constants and the justifications.. (context) - Martin-Lof - 1996
68
Unification under a mixed prefix (context) - Miller - 1992
61
Higher-order unification via explicit substitutions
- Dowek, Hardin et al. - 1995
37
Unification via explicit substitutions: The case of higher-o..
- Dowek, Hardin et al. - 1996
8
Optimizing higher-order pattern unification
- Pientka, Pfennning - 2003
4
Higher-order substitution tree indexing
- Pientka - 2003
4
Tabled higher-order logic programming
- Pientka - 2003
Documents on the same site (http://www-2.cs.cmu.edu/~fp/papers/): More
A Type Theory for Memory Allocation and Data Layout - Petersen, Harper, Crary.. (2002)
(Correct)
Trustless Grid Computing in ConCert - Chang, Crary, DeLap, Harper.. (2002)
(Correct)
A Concurrent Logical Framework: The Propositional.. - Watkins, Cervesato.. (2003)
(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