@book{Breitner2016,
abstract = { 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.Umfang: XIV, 231 S.Preis: €36.00 | £33.00 | $63.00},
address = {Karlsruhe},
author = {Breitner, Joachim},
doi = {10.5445/KSP/1000056002},
isbn = {978-3-7315-0546-4},
keyword = {Funktionale Programmierung Formale Verifikation Semantik Isabelle Haskell, Functional Programming Semantics Formal Verification Haskell Isabelle},
month = {Sep},
pages = {256},
publisher = {KIT Scientific Publishing},
title = {Lazy Evaluation: From natural semantics to a machine-checked compiler transformation},
year = {2016}
}