Lazy Evaluation: From natural semantics to a machine-checked compiler transformation

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 Isab...

Full description

Saved in:
Bibliographic Details
Main Author: Breitner, Joachim (auth)
Format: Electronic Book Chapter
Language:English
Published: KIT Scientific Publishing 2016
Subjects:
Online Access:DOAB: download the publication
DOAB: description of the publication
Tags: Add Tag
No Tags, Be the first to tag this record!

MARC

LEADER 00000naaaa2200000uu 4500
001 doab_20_500_12854_51469
005 20210211
003 oapen
006 m o d
007 cr|mn|---annan
008 20210211s2016 xx |||||o ||| 0|eng d
020 |a KSP/1000056002 
020 |a 9783731505464 
040 |a oapen  |c oapen 
024 7 |a 10.5445/KSP/1000056002  |c doi 
041 0 |a eng 
042 |a dc 
100 1 |a Breitner, Joachim  |4 auth 
245 1 0 |a Lazy Evaluation: From natural semantics to a machine-checked compiler transformation 
260 |b KIT Scientific Publishing  |c 2016 
300 |a 1 electronic resource (XIV, 231 p. p.) 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
506 0 |a Open Access  |2 star  |f Unrestricted online access 
520 |a 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. 
540 |a Creative Commons  |f https://creativecommons.org/licenses/by-sa/4.0/  |2 cc  |4 https://creativecommons.org/licenses/by-sa/4.0/ 
546 |a English 
653 |a Funktionale Programmierung Formale Verifikation Semantik Isabelle HaskellFunctional Programming Semantics Formal Verification Haskell Isabelle 
856 4 0 |a www.oapen.org  |u https://www.ksp.kit.edu/9783731505464  |7 0  |z DOAB: download the publication 
856 4 0 |a www.oapen.org  |u https://directory.doabooks.org/handle/20.500.12854/51469  |7 0  |z DOAB: description of the publication