Step-Indexed Normalization for a Language with General Recursion
Abstract
The Trellys project has produced several designs for practical dependently typed languages. These languages are broken into two fragments-a_logical_fragment where every term normalizes and which is consistent when interpreted as a logic, and a_programmatic_fragment with general recursion and other convenient but unsound features. In this paper, we present a small example language in this style. Our design allows the programmer to explicitly mention and pass information between the two fragments. We show that this feature substantially complicates the metatheory and present a new technique, combining the traditional Girard-Tait method with step-indexed logical relations, which we use to show normalization for the logical fragment.
Cite
@article{arxiv.1202.2918,
title = {Step-Indexed Normalization for a Language with General Recursion},
author = {Chris Casinghino and Vilhelm Sjöberg and Stephanie Weirich},
journal= {arXiv preprint arXiv:1202.2918},
year = {2012}
}
Comments
In Proceedings MSFP 2012, arXiv:1202.2407