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...
Saved in:
| Main Author: | |
|---|---|
| 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!
|