Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 206

The DOI matches its Crossref record.

A gentle introduction to Haskell

Open access
Hudak, Paul, Fasel, Joseph H. · 1992 · ACM SIGPLAN Notices

Abstract

For pedagogical purposes, when we wish to indicate that an expression e 1 evaluates, or "reduces," to another expression or value e 2 , we will write:For example, note that: inc (inc 3) ⇒ 5Haskell's static type system defines the formal relationship between types and values ( §4.1.3).The static type system ensures that Haskell programs are type safe; that is, that the programmer has not mismatched types in some way.For example, we cannot generally add together two characters, so the expression 'a'+'b' is ill-typed.The main advantage of statically typed languages is well-known: All type errors are detected at compile-time.Not all errors are caught by the type system; an expression such as 1/0 is typable but its evaluation will result in an error at execution time.Still, the type system finds many program errors at compile time, aids the user in reasoning about programs, and also permits a compiler to generate more efficient code (for example, no run-time type tags or tests are required).Here are two other useful polymorphic functions on lists that will be used later.Function head returns the first element of a list, function tail returns all but the first.head :: [a] -> a head (x:xs) = x tail :: [a] -> [a] tail (x:xs) = xsUnlike length, these functions are not defined for all possible values of their argument.A runtime error occurs when these functions are applied to an empty list.With polymorphic types, we find that some types are in a sense strictly more general than others in the sense that the set of values they define is larger.For example, the type [a] is more general than [Char].In other words, the latter type can be derived from the former by a suitable substitution for a.With regard to this generalization ordering, Haskell's type system possesses two important properties: First, every well-typed expression is guaranteed to have a unique principal type (explained below), and second, the principal type can be inferred automatically ( §4.1.3).In comparison to a monomorphically typed language such as C, the reader will find that polymorphism improves expressiveness, and type inference lessens the burden of types on the programmer.An expression's or function's principal type is the least general type that, intuitively, "contains all instances of the expression".For example, the principal type of head is [a]->a; [b]->a, a->a, or even a are correct types, but too general, whereas something like [Integer]->Integer is too specific.The existence of unique principal types is the hallmark feature of the Hindley-Milner type system, which forms the basis of the type systems of Haskell, ML, Miranda, 4 and several other (mostly functional) languages.[1..10] ⇒ [1,2,3,4,5,6,7,8,9,10] [1,3..10] ⇒ [1,3,5,7,9] [1,3..] ⇒ [1,3,5,7,9, ... (infinite sequence)More will be said about arithmetic sequences in Section 8.2, and "infinite lists" in Section 3.4.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/130697.130698

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 206

Metadata

Authors
Hudak, P., & Fasel, J. H.
Venue
ACM SIGPLAN Notices
Published
1992-05
Volume
27
Issue
5
Pages
1-52
ISSN
  • 0362-1340 (ISSN-L)
  • 1558-1160
OpenAlex
W2020784851
Cited by
206
References
0
FWCI
11.18
Type
journal article
Language
en
Open access
bronze

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: A gentle introduction to Haskell. https://app.cochat.ai/papers/10.1145/130697.130698
The paper
Hudak, P., & Fasel, J. H. (1992). A gentle introduction to Haskell. ACM SIGPLAN Notices. https://doi.org/10.1145/130697.130698

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.