Hostname: page-component-7c8c6479df-5xszh Total loading time: 0 Render date: 2024-03-28T11:29:30.765Z Has data issue: false hasContentIssue false

Pure type systems with explicit substitution

Published online by Cambridge University Press:  07 March 2001

ROEL BLOO
Affiliation:
Faculty of Mathematics and Computer Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, The Netherlands. E-mail: c.j.bloo@tue.nl

Abstract

We define an extension of pure type systems with explicit substitution. We show that the type systems with explicit substitution are strongly normalizing iff their ordinary counterparts are. Subject reduction is shown to fail in general but a weaker, though still useful, subject reduction property is established. A more complicated extension is proposed for which subject reduction does hold in general.

Type
Research Article
Copyright
© 2001 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)