The Glasgow Haskell compiler: a technical overview Page 1 The Glasgow Haskell compiler: a
technical overview Simon L Peyton Jones Cordy Hall Kevin Hammond Will Partain Phil …

We define an operational semantics for lazy evaluation which provides an accurate model
for sharing. The only computational structure we introduce is a set of bindings which …

The Spineless Tagless G-machine is an abstract machine designed to support non-strict
higher-order functional languages. This presentation of the machine falls into three parts …

The mismatch between the operational semantics of the lambda calculus and the actual
behavior of implementations is a major obstacle for compiler writers. They cannot explain …

Qualified types can be viewed as a generalization of type classes in the functional language
Haskell and the theorem prover Isabelle. These in turn are extensions of equality types in …

Many compilers do some of their work by means of correctness-preserving, and hopefully
performance-improving, program transformations. The Glasgow Haskell Compiler (GHC) …

Many compilers do some of their work by means of correctness-preserving, and hopefully
performance-improving, program transformations. The Glasgow Haskell Compiler (GHC) …

Virtually every compiler performs transformations on the program it is compiling in an
attempt to improve efficiency. Despite their importance, however, there have been few …

Andre Luis de Medeiros Santos Page 1 Department of Computing Science Compilation by
Transformation in Non-Strict Functional Languages Andre Luis de Medeiros Santos …

We present a sound type-based'usage analysis' for a realistic lazy functional language.
Accurate information on the usage of program subexpressions in a lazy functional language …