Lazy Evaluation : From Natural Semantics to a Machine-checked Compiler Transformation Hardback
by Joachim Breitner
Hardback
Description
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 that end, a formalization of Launchbury's Natural Semantics for Lazy Evaluation is modelled in Isabelle, including a correctness and adequacy proof.
This work was published by Saint Philip Street Press pursuant to a Creative Commons license permitting commercial use. All rights not granted by the work's license are retained by the author or authors.
Information
-
Item not Available
- Format:Hardback
- Pages:252 pages
- Publisher:Saint Philip Street Press
- Publication Date:09/10/2020
- Category:
- ISBN:9781013279799
Other Formats
- Paperback / softback from £47.70
Information
-
Item not Available
- Format:Hardback
- Pages:252 pages
- Publisher:Saint Philip Street Press
- Publication Date:09/10/2020
- Category:
- ISBN:9781013279799