Multi-level Contextual Type Theory

  title={Multi-level Contextual Type Theory},
  author={M. Boespflug and B. Pientka},
  • M. Boespflug, B. Pientka
  • Published in LFMTP 2011
  • Computer Science, Mathematics
  • Contextual type theory distinguishes between bound variables and meta-variables to write potentially incomplete terms in the presence of binders. It has found good use as a framework for concise explanations of higher-order unification, characterize holes in proofs, and in developing a foundation for programming with higher-order abstract syntax, as embodied by the programming and reasoning environment Beluga. However, to reason about these applications, we need to introduce meta^2-variables to… CONTINUE READING
    4 Citations
    A Meta Lambda Calculus with Cross-Level Computation
    • 3
    Proofs and Programs about Open Terms
    • PDF
    Multimodal Dependent Type Theory
    • 8
    • PDF
    Implementing a modal dependent type theory
    • 9
    • PDF


    A type-theoretic foundation for programming with higher-order abstract syntax and first-class substitutions
    • 124
    • PDF
    A modal type system for multi-level generating extensions with persistent code
    • 28
    • PDF
    Explicit Substitutions for Contextual Type Theory
    • 8
    • PDF
    Optimizing Higher-Order Pattern Unification
    • 44
    • PDF
    Higher-Order Dynamic Pattern Unification for Dependent Types and Records
    • 33
    • PDF
    The lambda-context calculus (extended version)
    • 10
    • PDF
    A concurrent logical framework I: Judgments and properties
    • 168
    • Highly Influential
    • PDF
    A framework for defining logics
    • 1,306
    • PDF
    Beluga: A Framework for Programming and Reasoning with Deductive Systems (System Description)
    • 121
    • PDF
    VeriML: typed computation of logical terms inside a language with effects
    • 40
    • PDF