Ph.D. thesis: Lazy Evaluation: From natural semantics to a machine-checked compiler transformation

[breitner16thesis]

Joachim Breitner, Lazy Evaluation: From natural semantics to a machine-checked compiler transformation, Karlsruher Institut für Technologie, Fakultät für Informatik, April 2016.

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.

Download

[DOI]

BibTeX

@phdthesis{breitner16thesis,
  title = {Lazy Evaluation: From natural semantics to a machine-checked compiler transformation},
  year = {2016},
  month = apr,
  author = {Joachim Breitner},
  school = {Karlsruher Institut f{\"u}r Technologie, Fakult{\"a}t f{\"u}r Informatik},
  url = {http://www.joachim-breitner.de/thesis/},
  doi = {10.5445/IR/1000054251},
}

Authors at the institute

Former Staff Member
Dr. rer. nat. Joachim Breitner