Lazy Evaluation From Natural Semantics to a Machine-checked Compiler Transformation
Availability: In stock
Regular Price
AED 250.00
Special Price
AED 237.50
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. This work was published by Saint Philip Street Press pursuant to a Creative Commons license permitting commercial use. All rights not granted by the work's license are retained by the author or authors.
| Publisher Name | Saint Philip Street Press |
|---|---|
| Author Name | Hagendorf, Col |
| Format | Audio |
| Bisac Subject Major | COM |
| Language | NG |
| Isbn 10 | 1013279786 |
| Isbn 13 | 9781013279782 |
| Target Age Group | min:NA, max:NA |
| Dimensions | 01.10" H x 20.08" L x 50.00" W |
| Page Count | 252 |
Write Your Own Review
Recommended Products
![Goodnight Moon [With Plush]](https://www.booksvenue.com/media/import/IMG_BKLST/ftp.ingramcontent.com/IMG_BKLST/9780060760274.jpg)
The Secret of The Nagas (Shiva...
Today, He is a God. 4000 years ago, He was just a man.
The hunt is on. The sinister Naga warrior...
AED 40.00
