Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Preliminary Report. Final version to appear in: # A. Abel & B. Pientka
 

Summary: Preliminary Report. Final version to appear in:
LFMTP 2010
c
# A. Abel & B. Pientka
This work is licensed under the
Creative Commons Attribution License.
Explicit Substitutions for Contextual Type Theory
Andreas Abel
Theoretical Computer Science, Ludwig­Maximilians­University Munich, Germany
andreas.abel@ifi.lmu.de
Brigitte Pientka
School of Computer Science, McGill University, Montreal, Canada
bpientka@cs.mcgill.ca
In this paper, we present an explicit substitution calculus which distinguishes between ordinary bound
variables and meta­variables. Its typing discipline is derived from contextual modal type theory. We
first present a dependently typed lambda calculus with explicit substitutions for ordinary variables
and explicit meta­substitutions for meta­variables. We then present a weak head normalization pro­
cedure which performs both substitutions lazily and in a single pass thereby combining substitution
walks for the two different classes of variables. Finally, we describe a bidirectional type checking
algorithm which uses weak head normalization and prove soundness.

  

Source: Abel, Andreas - Theoretische Informatik, Ludwig-Maximilians-Universität München

 

Collections: Computer Technologies and Information Sciences