[图书][B] Lazy Evaluation: From natural semantics to a machine-checked compiler transformation

J Breitner - 2016 - books.google.com
In order to solve a long-standing problem with list fusion, a new compiler transformation,"
Call Arity" is developed and implemented in the Haskell compiler GHC. It is formally proven …

Automated reasoning in higher-order regular algebra

A Armstrong, G Struth - … Conference on Relational and Algebraic Methods …, 2012 - Springer
We extend a large Isabelle/HOL repository for regular algebras towards higher-order
variants based on directed sets and quantales, including reasoning based on general …

Short note: Strict unwraps make worker/wrapper fusion totally correct

P Gammie - Journal of Functional Programming, 2011 - cambridge.org
The worker/wrapper transformation is a general way of changing the type of a recursive
definition, usually applied with an eye to increasing algorithmic efficiency. This note …

[PDF][PDF] Lazy Evaluation: From natural semantics

J Breitner - joachim-breitner.de
IT is a pleasure to create programs in functional programming languages, as they allow for a
very high-level style of programming, using abstraction and composition. It suits the human …