---
title: Orwell (programming language)
slug: orwell-programming-language
qid: 
snapshot: enwiki-001351817107
content_hash: 
license: CC BY-SA 4.0
source: https://en.wikipedia.org/w/index.php?oldid=1351817107
tags: [23118434, 23468805, 23514620, 23603337, 24043274, 24153113, 28699009, 3469232, 44206875, 60433035]
---

# Orwell (programming language)

> [!note] Provenance
> Snapshot `enwiki-001351817107` · content root `…`
> Derived from <https://en.wikipedia.org/w/index.php?oldid=1351817107> · Licensed CC BY-SA 4.0

Orwell is a small, lazy evaluation, functional programming language implemented principally by Martin Raskovsky and first released in 1984 by Philip Wadler during his time as a Research Fellow in the Programming Research Group, part of the Oxford University Computing Laboratory. Developed as a free alternative to Miranda, it was a forerunner of Haskell and was one of the first programming languages to support list comprehensions and pattern matching. The name is a tribute to George Orwell's novel Nineteen Eighty-Four, the year in which the language was released. In the late 1980s and the 1990s, most of the computing practical assignments for undergraduates studying for a degree in Mathematics and Computation at Oxford University were required to be completed using the language.

Orwell is a small, lazy evaluation, functional programming language implemented principally by Martin Raskovsky and first released in 1984 by Philip Wadler during his time as a Research Fellow in the Programming Research Group, part of the Oxford University Computing Laboratory. Developed as a free alternative to Miranda, it was a forerunner of Haskell and was one of the first programming languages to support list comprehensions and pattern matching. The name is a tribute to George Orwell's novel Nineteen Eighty-Four, the year in which the language was released. In the late 1980s and the 1990s, most of the computing practical assignments for undergraduates studying for a degree in Mathematics and Computation at Oxford University were required to be completed using the language. ==References==
