Abstract
In this paper, we show the weak normalization (WN) of the simply-typed ?se-calculus with open terms where abstractions are decorated with types, and metavariables, de Bruijn indices and updating operators are decorated with environments. We show a proof of WN using the ??e-calculus, a calculus isomorphic to ?se?. This proof is strongly influenced by Goubault-Larrecq's proof of WN for the ?s-calculus but with subtle differences which show that the two styles require different attention. Furthermore, we give a new calculus ??'e which works like ?se but which is closer to ?s than ??e. For both ??e and ??'e we prove WN for typed semi-open terms (i.e. those which allow term variables but no substitution variables), unlike the result of Goubault-Larrecq which covered all ?s open terms. © The Author, 2007. Published by Oxford University Press. All rights reserved.
Original language | English |
---|---|
Pages (from-to) | 121-147 |
Number of pages | 27 |
Journal | Logic Journal of the IGPL |
Volume | 15 |
Issue number | 2 |
DOIs | |
Publication status | Published - Mar 2007 |
Keywords
- Explicit substitution
- Lambda calculus
- Normalization
- Simple typing