Lazy Evaluation: From natural semantics to a machine-checked compiler transformation
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 to not degrade program performance; the proof is machine-checked using the interactive theorem prover Isabelle. To t...
Saved in:
: | |
---|---|
Year of Publication: | 2016 |
Language: | English |
Physical Description: | 1 electronic resource (XIV, 231 p. p.) |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A Machine-Checked, Type-Safe Model of Java Concurrency : Language, Virtual Machine, Memory Model, and Verified Compiler
by: Lochbihler, Andreas
Published: (2012) -
Lazy man in China / Helene Chung Martin.
by: Martin, Helene Chung,
Published: (c2004.) -
Jacob Buus als Motettenkomponist / Walter Breitner
by: Breitner, Walter
Published: (1977) -
Trustworthy compilers / Vladimir O. Safonov.
by: Safonov, V. O.
Published: (2010.) - Compiler (Online)