Efficient Interpretation by Transforming Data Types and Patterns to Functions

This paper [pdf] describes an efficient interpreter for lazy functional languages like Haskell and Clean. The interpreter is based on the elimination of algebraic data types and pattern-based function definitions by mapping them to functions using a new efficient variant of the Church encoding. The transformation is simple and yields concise code.

Comment viewing options

Select your preferred way to display the comments and click "Save settings" to activate your changes.

Isn't this just Scott

Isn't this Scott encoding?