Lazy Evaluation: From natural semantics to a machine-checked compiler transformation
Résumé
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.
Keywords
Funktionale Programmierung Formale Verifikation Semantik Isabelle HaskellFunctional Programming Semantics Formal Verification Haskell IsabelleISBN
9783731505464Publisher
KIT Scientific PublishingPublisher website
http://www.ksp.kit.edu/Publication date and place
2016Classification
Computer science