
Conte aos seus amigos sobre este item:
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.
Mídia | Livros Paperback Book (Livro de capa flexível e brochura) |
Lançado | 30 de setembro de 2016 |
ISBN13 | 9783731505464 |
Editoras | Karlsruher Institut für Technologie |
Páginas | 256 |
Dimensões | 148 × 210 × 15 mm · 376 g |
Idioma | German |
Ver tudo de Joachim Breitner ( por exemplo Paperback Book )