• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Explicit Contexts in LF (Revised)

Cached

  • Download as a PDF

Download Links

  • [www.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www-2.cs.cmu.edu]
  • [www.ius.cs.cmu.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Karl Crary
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Crary_explicitcontexts,
    author = {Karl Crary},
    title = {Explicit Contexts in LF (Revised)},
    year = {}
}

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

The standard methodology for representing deductive systems in LF identifies the object’s language’s context with the LF context. Consequently, any variable dealt with explicitly by any judgement or metatheorem must be last in the context. When the object language is dependently typed, this can pose a problem for establishing some metatheoretic results, since dependent hypotheses cannot be re-ordered at will. This paper presents a general technique that addresses such problems, based on representing the object language’s context as an explicit object in LF while retaining the use of higher-order representation for the object language’s syntax. A central result is that it is possible to convert between explicit and implicit contexts, which makes it feasible to use the standard methodology for most developments, but use explicit contexts where necessary. We do not propose any extensions to LF; the technique can be utilized in standard LF. 1

Citations

634 A framework for defining logics - Harper, Honsell, et al. - 1993
251 A type-theoretic approach to higher-order modules - Harper, Lillibridge - 1994
208 Manifest types, modules, and separate compilation - Leroy - 1994
111 Mechanized metatheory for the masses: The PoplMark challenge - Aydemir, Bohannon, et al. - 2005
96 Applicative functors and fully transparent higher-order modules - Leroy - 1995
60 Towards a mechanized metatheory of Standard ML - Lee, Crary, et al.
59 A concurrent logical framework i: Judgments and properties - Watkins, Cervesato, et al. - 2002
40 A type-theoretic foundation for programming with higher-order abstract syntax and first-class substitutions - Pientka - 2008
38 Contextual modal type theory - Nanevski, Pfenning, et al.
8 Twelf User’s Guide, Version 1.4, 2002. Available electronically at http://www.cs.cmu.edu/~twelf - Pfenning, Schürmann
5 Explicit contexts in LF - Crary - 2008
5 Proof pearl: The power of higher-order encodings in the logical framework LF - Pientka - 2007
5 Higher-order superposition for dependent types - Virga - 1995
2 A syntactic account of singleton types via hereditary substitution - Crary - 2009
1 Mechanizing the metatheory of a language with linear resources and context effects (abstract - Lee, Dreyer, et al. - 2008
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University