Formulating Haskell (1993) [5 citations — 1 self]
by Simon Thompson
In Workshop on Functional Programming, Ayr, 1992, Workshops in Computing
ftp://unix.hensa.ac.uk/pub/misc/ukc.reports/comp.sci/reports/29-92.ps.Z
Add To MetaCart
Abstract:
The functional programming language Haskell is examined from the point of view of proving programs correct. Particular features explored include the data type definition facilities, classes, the behaviour of patterns and guards and the monad approach to IO in the Glasgow Haskell compiler. 1
Citations
| 1128 | Monads for functional programming – Wadler - 1992 |
| 127 | Logic and Computation: Interactive Proof with Cambridge LCF – Paulson - 1987 |
| 89 | A gentle introduction to Haskell – Hudak, Fasel - 1992 |
| 65 | editors. Report on the Programming Language Haskell 98, A Non-strict Purely Functional Language – Jones, Hughes - 1999 |
| 46 | A co-induction principle for recursively defined domains – Pitts - 1994 |
| 18 | Interactive functional programs: a method and a formal semantics – Thompson - 1990 |
| 16 | A Logic for Miranda – Thompson - 1989 |
