A logical framework with explicit conversions

J.H. Geuvers, F. Wiedijk

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

2 Citations (Scopus)

Abstract

The type theory ¿P corresponds to the logical framework LF. In this paper we present ¿H, a variant of ¿P where convertibility is not implemented by means of the customary conversion rule, but instead type conversions are made explicit in the terms. This means that the time to type check a ¿H term is proportional to the size of the term itself. We define an erasure map from ¿H to ¿P, and show that through this map the type theory ¿H corresponds exactly to ¿P: any ¿H judgment will be erased to a ¿P judgment, and conversely each ¿P judgment can be lifted to a ¿H judgment. We also show a version of subject reduction: if two ¿H terms are provably convertible then their types are also provably convertible.
Original languageEnglish
Title of host publicationProceedings 4th International Workshop on Logical Frameworks and Meta-Languages (LFM'04, Cork, Ireland, July 5, 2004)
EditorsC. Schürmann
Pages33-47
DOIs
Publication statusPublished - 2008

Publication series

NameElectronic Notes in Theoretical Computer Science
Volume199
ISSN (Print)1571-0061

Fingerprint

Dive into the research topics of 'A logical framework with explicit conversions'. Together they form a unique fingerprint.

Cite this