Please note: In order to keep Hive up to date and provide users with the best features, we are no longer able to fully support Internet Explorer. The site is still available to you, however some sections of the site may appear broken. We would encourage you to move to a more modern browser like Firefox, Edge or Chrome in order to experience the site fully.

Supporting your high street Find out how »
Lazy Evaluation : From Natural Semantics to a Machine-checked Compiler Transformation, Paperback / softback Book

Lazy Evaluation : From Natural Semantics to a Machine-checked Compiler Transformation Paperback / softback

Paperback / softback

Item not Available

Description

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.

Information

  • Item not Available

  • Format:Paperback / softback
  • Pages:252 pages
  • Publisher:Saint Philip Street Press
  • Publication Date:
  • Category:
  • ISBN:9781013279782

Other Formats

£47.70

Item not Available
Item not Available
Sign in to add to wishlist
 
Free Home Delivery

on all orders

 
Pick up orders

from local bookshops

Information

  • Item not Available

  • Format:Paperback / softback
  • Pages:252 pages
  • Publisher:Saint Philip Street Press
  • Publication Date:
  • Category:
  • ISBN:9781013279782