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 Isab...
| Main Author: | |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
KIT Scientific Publishing
2016
|
| Subjects: | |
| Online Access: | |
| Collection: | Directory of Open Access Books - Collection details see MPG.ReNa |
| Summary: | 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. |
|---|---|
| Item Description: | Creative Commons (cc), https://creativecommons.org/licenses/by-sa/4.0/ |
| Physical Description: | 1 electronic resource (XIV, 231 p. p.) |
| ISBN: | 9783731505464 1000056002 |