Normalization and Partial Evaluation
Paper i proceeding, 2002

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-by-name and call-by-value versions of this language.

Författare

Peter Dybjer

Chalmers, Institutionen för datavetenskap, Programmeringslogik

Andrzej Filinski

Lecture Notes in Computer Science

0302-9743 (ISSN)

Vol. 2395 137-192

Ämneskategorier

Annan matematik

DOI

10.1007/3-540-45699-6_4

ISBN

978-3-540-44044-4

Mer information

Skapat

2017-10-06