Normalization and Partial Evaluation
Lecture Notes In Computer SciencePeter Dybjer +12002Book series
We give an introduction to normalization by evaluation and type-directed partial evaluation. We first present normalization by evaluation for a combinatory version of G枚del System T. Then we show normalization by evaluation for typed lambda calculus with 脽 and 驴 conversion. Finally, we introduce the notion of binding time, and explain the method of type-directed partial evaluation for a small PCF-style functional programming language. We give algorithms for both call-byname and call-by-value versions of this language.
The content you want is available to Zendy users.
Already have an account? Sign inHaving issues? Contact support