Lazy Evaluation: From natural semantics to a machine-checked compiler transformation
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.
| Zugehörige Institution(en) am KIT | Institut für Programmstrukturen und Datenorganisation (IPD) |
| Publikationstyp | Hochschulschrift |
| Publikationsjahr | 2016 |
| Sprache | Englisch |
| Identifikator | urn:nbn:de:swb:90-542518 KITopen-ID: 1000054251 |
| Verlag | Karlsruher Institut für Technologie (KIT) |
| Umfang | XVI, 226 S. |
| Art der Arbeit | Dissertation |
| Fakultät | Fakultät für Informatik (INFORMATIK) |
| Institut | Institut für Programmstrukturen und Datenorganisation (IPD) |
| Prüfungsdaten | 25.04.2016 |
| Schlagwörter | Haskell, Lazy Evaluation, Call Arity, Interactive Theorem Proving |
| Relationen in KITopen | |
| Referent/Betreuer | Snelting, G. |