Haskell

Haskell is a statically typed, purely functional programming language with lazy evaluation. Its type system supports features such as type classes, algebraic data types, and higher-kinded types.

Lazy evaluation: An evaluation strategy that delays computing an expression until its value is needed. Haskell’s non-strict semantics let programs work with infinite structures and avoid unnecessary computation.
Lambda calculus: A formal system for expressing computation through function abstraction and application. Haskell’s functions and evaluation rules draw on the computational model of lambda calculus.
Miranda: A non-strict functional programming language designed by David Turner and released in 1985. Miranda influenced Haskell’s design and helped motivate a shared standard for lazy languages.
QuickCheck: A property-based testing library that generates test data to check general claims about programs. QuickCheck originated in Haskell and became a prominent example of testing through executable properties.
OCaml: A statically typed functional programming language with strict evaluation and an ML-derived type system. OCaml offers functional programming with eager evaluation and a more conventional effect model.
Hindley–Milner type system: A type system that infers polymorphic types for expressions without requiring explicit type annotations. It underlies Haskell’s type inference, extended with features such as type classes.
Referential transparency: A property whereby an expression can be replaced by its value without changing program behavior. Pure Haskell expressions are referentially transparent, supporting local reasoning about code.
Haskell 1.0: The first published Haskell language report, released in 1990. This report established the language’s initial standardized definition.
Pandoc: A document converter that translates among markup formats, written primarily in Haskell. Pandoc demonstrates Haskell’s use in a widely deployed command-line application.
Standard ML: A statically typed functional language in the ML family, standardized with strict evaluation. Standard ML shares Haskell’s ML heritage but differs in evaluation strategy and type-class design.

Linked from 3 pages