登入
選單
返回
Google圖書搜尋
Lazy Evaluation: From natural semantics to a machine-checked compiler transformation
Breitner, Joachim
出版
KIT Scientific Publishing
, 2016-09-20
ISBN
3731505460
9783731505464
URL
http://books.google.com.hk/books?id=NLhGDQAAQBAJ&hl=&source=gbs_api
EBook
SAMPLE
註釋
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.
