### Abstract

The Isabelle/HOLCF-Prelude is a formalization of a large part of Haskell's standard prelude in Isabelle/HOLCF. We use it to prove the correctness of the Eratosthenes' Sieve, in its self-referential implementation commonly used to showcase Haskell's laziness; prove correctness of GHC's "fold/build" rule and related rewrite rules; and certify a number of hints suggested by HLint.

### License

BSD License

### Topics

- Computer science/Functional programming

### Session HOLCF-Prelude

- HOLCF_Main
- Type_Classes
- Numeral_Cpo
- Data_Function
- Data_Bool
- Data_Tuple
- Data_Integer
- Data_List
- Data_Maybe
- Definedness
- List_Comprehension
- Num_Class
- HOLCF_Prelude
- Fibs
- Sieve_Primes
- GHC_Rewrite_Rules
- HLint

### Used by

- Putting the `K' into Bird’s derivation of Knuth-Morris-Pratt string matching

## Cite

×

HOLCF-Prelude-AFP

    @article{HOLCF-Prelude-AFP,
      author  = {Joachim Breitner and Brian Huffman and Neil Mitchell and Christian Sternagel},
      title   = {HOLCF-Prelude},
      journal = {Archive of Formal Proofs},
      month   = {July},
      year    = {2017},
      note    = {\url{https://isa-afp.org/entries/HOLCF-Prelude.html},
                 Formal proof development},
      ISSN    = {2150-914x},
    }

Download

## Download

× Download latest

Older releases:

- Sep 13, 2023 : Isabelle2023
- Oct 27, 2022 : Isabelle2022
- Dec 14, 2021 : Isabelle2021-1
- Feb 23, 2021 : Isabelle2021
- Apr 18, 2020 : Isabelle2020
- Jun 11, 2019 : Isabelle2019
- Aug 16, 2018 : Isabelle2018
- Oct 10, 2017 : Isabelle2017
- Jul 15, 2017 : Isabelle2016-1