In type theory, a type system has the property of subject reduction (also subject evaluation, type preservation or simply preservation) if evaluation of expressions does not cause their type to change. Formally, if Γ ⊢ e1 : τ and e1 → e2 then Γ ⊢ e2 : τ.
The opposite property, if Γ ⊢ e2 : τ and e1 → e2 then Γ ⊢ e1 : τ, is called subject expansion. It often does not hold as evaluation can erase ill-typed sub-terms of an expression, resulting in a well-typed one.
- Wright, Andrew K.; Felleisen, Matthias (1994). "A Syntactic Approach to Type Soundness". Information and Computation 115 (1): 38–94. doi:10.1006/inco.1994.1093.
- Pierce, Benjamin C. (2002). "8.3 Safety = Progress + Preservation". Types and Programming Languages. MIT Press. ISBN 978-0-262-16209-8.
|This programming language theory or type theory-related article is a stub. You can help Wikipedia by expanding it.|