Pastāsti draugiem par šo preci:
Lazy Evaluation: From natural semantics to a machine-checked compiler transformation Joachim Breitner
Lazy Evaluation: From natural semantics to a machine-checked compiler transformation
Joachim Breitner
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.
| Mediji | Grāmatas Paperback Book (Grāmata ar mīksto vāku un līmēto muguru) |
| Izlaists | 2016. gada 30. septembris |
| ISBN13 | 9783731505464 |
| Izdevēji | Karlsruher Institut für Technologie |
| Lapas | 256 |
| Izmēri | 148 × 210 × 15 mm · 376 g |
| Valoda | Vācu |