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

DOI registrant

Association for Computing Machinery

Link

https://doi.org/10.1145/1238844.1238856

Cited from

computer_science

Cited by

2 citations across 2 artifacts.

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.

Domain-specific

• Graph reduction
  • … semantics, expression graph and sharing, redex-selection rule, rewrite and update operation, treatment of recursion and garbage, normal form and observational-equivalence argument are explicit. to An applied instance preserves the same invariant under changed scale, notation, dataset, jurisdiction, or implementation..

Verification

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Not recorded. Neither this nor any other of the 2 citations of this work carries a recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:df4fe1bc48b2 · see in the full table