Lazy Evaluation: From natural semantics to a machine-checked compiler transformation
Dissertationsschrift
(Sprache: Englisch)
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...
Voraussichtlich lieferbar in 3 Tag(en)
versandkostenfrei
Buch (Kartoniert)
37.10 €
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenlose Rücksendung
Produktdetails
Produktinformationen zu „Lazy Evaluation: From natural semantics to a machine-checked compiler transformation “
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.
Klappentext zu „Lazy Evaluation: From natural semantics to a machine-checked compiler transformation “
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.
Bibliographische Angaben
- Autor: Joachim Breitner
- 2016, 256 Seiten, mit Abbildungen, Maße: 14,8 x 21 cm, Kartoniert (TB), Englisch
- Verlag: KIT Scientific Publishing
- ISBN-10: 3731505460
- ISBN-13: 9783731505464
Sprache:
Englisch
Kommentar zu "Lazy Evaluation: From natural semantics to a machine-checked compiler transformation"
Schreiben Sie einen Kommentar zu "Lazy Evaluation: From natural semantics to a machine-checked compiler transformation".
Kommentar verfassen