A History of Haskell

Hudak, P., Hughes, J., Peyton Jones, S., & Wadler, P. (2007). A History of Haskell: Being Lazy with Class. Proceedings of the Third ACM SIGPLAN Conference on History of Programming Languages (HOPL III).

Type

Conference paper

Intellectual base

Primary research

Year

2007

DOI

10.1145/1238844.1238856

Link

https://doi.org/10.1145/1238844.1238856

Cited from

computer_science

Cited by

1 citation across 1 artifact.

Each citation links to the sentence it supports in the citing article.

Primes

• Lazy Evaluation
  • Take a lazy infinite stream in a call-by-need language — the canonical fibs = 0 : 1 : zipWith (+) fibs (tail fibs) — as the rigorous instance.

    This sourceDocuments lazy evaluation in Haskell, including thunks and canonical lazy infinite streams such as the recursively-defined Fibonacci sequence.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:df4fe1bc48b2 · see in the full table