Haskell 2010 Language Report

Marlow, S. (2010). Haskell 2010 Language Report.

Type

Standard

Intellectual base

Reference work

Year

2010

Link

https://www.haskell.org/onlinereport/haskell2010/

Cited by

5 citations across 5 artifacts.

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

Domain-specific

• Exportation (logic)
  • A Haskell function on a pair can be curried into a function returning a function; that is a typed-programming analogue under propositions-as-types, not a warrant to rewrite arbitrary source code or to treat a computational type as a truth-functional proposition.

    This sourceOfficial language report. It directly supports the pair-input and curried-function conversions; applying them as a Curry–Howard analogue is explicitly labelled as an interpretation.

• Functor
  • In functional programming the same two laws are axiomatized directly: Haskell's Functor class requires fmap id = id and fmap (g . f) = fmap g . fmap f of every instance, so List, Maybe, Tree, and IO all admit a uniform fmap operation whose correctness is guaranteed by the axioms alone

    Supported in partVerified against the source

    Read by an automated reader; not a human review. How support was checked

• Programming Fold
  • Meijer, Fokkinga and Paterson describe the right-fold list catamorphism and extend constructor-based recursion schemes to algebraic datatypes; the Haskell Report separately specifies both list-fold directions.
• Tacit Programming
  • These forms omit the data argument, but their operators route arguments differently.

    This sourceDirectly opened; the specified equations rather than any compiler implementation are cited.

• Type constructor
  • A type constructor is an operator in a type language whose arguments and result are types.

Verification

Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.

Does it back the claim? Read against the text for 1 of 5 citations: 1 supported in part. Each verdict is shown under its citation below, with what in the work backs the sentence.

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.

Links previously used in the corpus

Before the registry existed this work was also linked 2 other ways.

• https://www.haskell.org/definition/haskell2010.pdf ×2
• https://www.haskell.org/onlinereport/haskell2010/haskellch9.html ×1

Registry ID ref:5c133d8b4ab2 · see in the full table