UID:
edoccha_9959145700402883
Format:
1 electronic resource (XIV, 231 p. p.)
ISBN:
1000056002
Content:
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.
Note:
English
Additional Edition:
ISBN 3-7315-0546-0
Language:
English
