Article contents
Pure type systems with explicit substitution
Published online by Cambridge University Press: 07 March 2001
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
- Information
- Copyright
- © 2001 Cambridge University Press
- 4
- Cited by