| Home |
| About |
| Submission |
| Updating Entries |
| Using Entries |
| Search |
| Statistics |
| Index |
| Download |
Stream Fusion in HOL with Code Generation
| Title: | Stream Fusion in HOL with Code Generation |
| Authors: | Andreas Lochbihler and Alexandra Maximova (amaximov /at/ student /dot/ ethz /dot/ ch) |
| Submission date: | 2014-10-10 |
| Abstract: | Stream Fusion is a system for removing intermediate list data structures from functional programs, in particular Haskell. This entry adapts stream fusion to Isabelle/HOL and its code generator. We define stream types for finite and possibly infinite lists and stream versions for most of the fusible list functions in the theories List and Coinductive_List, and prove them correct with respect to the conversion functions between lists and streams. The Stream Fusion transformation itself is implemented as a simproc in the preprocessor of the code generator. [Brian Huffman's AFP entry formalises stream fusion in HOLCF for the domain of lazy lists to prove the GHC compiler rewrite rules correct. In contrast, this work enables Isabelle's code generator to perform stream fusion itself. To that end, it covers both finite and coinductive lists from the HOL library and the Coinductive entry. The fusible list functions require specification and proof principles different from Huffman's.] |
| BibTeX: |
@article{Stream_Fusion_Code-AFP,
author = {Andreas Lochbihler and Alexandra Maximova},
title = {Stream Fusion in HOL with Code Generation},
journal = {Archive of Formal Proofs},
month = oct,
year = 2014,
note = {\url{http://isa-afp.org/entries/Stream_Fusion_Code.html},
Formal proof development},
ISSN = {2150-914x},
}
|
| License: | BSD License |
| Depends on: | Coinductive |
| Status: [ok] | This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations. |
|
Proof outline Proof document |
| Browse theories |
| Download this entry |