Show simple item record

dc.contributor.authorBreitner, Joachim*
dc.date.accessioned2021-02-11T17:29:50Z
dc.date.available2021-02-11T17:29:50Z
dc.date.issued2016*
dc.date.submitted2019-07-30 20:01:57*
dc.identifier34320*
dc.identifier.urihttps://directory.doabooks.org/handle/20.500.12854/51469
dc.description.abstractIn 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.*
dc.languageEnglish*
dc.subjectQA75.5-76.95*
dc.subject.classificationbic Book Industry Communication::U Computing & information technology::UY Computer scienceen_US
dc.subject.otherFunktionale Programmierung Formale Verifikation Semantik Isabelle HaskellFunctional Programming Semantics Formal Verification Haskell Isabelle*
dc.titleLazy Evaluation: From natural semantics to a machine-checked compiler transformation*
dc.typebook
oapen.identifier.doi10.5445/KSP/1000056002*
oapen.relation.isPublishedBy68fffc18-8f7b-44fa-ac7e-0b7d7d979bd2*
oapen.relation.isbn9783731505464*
oapen.pagesXIV, 231 p.*
peerreview.review.typeFull text
peerreview.anonymityAll identities known
peerreview.reviewer.typeInternal editor
peerreview.reviewer.typeExternal peer reviewer
peerreview.review.stagePre-publication
peerreview.open.reviewNo
peerreview.publish.responsibilityScientific or Editorial Board
peerreview.id8ad5c235-9810-49eb-b358-27c8675324d9
peerreview.titleDissertations (Dissertationen)


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

https://creativecommons.org/licenses/by-sa/4.0/
Except where otherwise noted, this item's license is described as https://creativecommons.org/licenses/by-sa/4.0/