Abstract

This paper gives a static semantics for Haskell 98, a non-strict purely functional programming language. The semantics formally specifies nearly all the details of the Haskell 98 type system, including the resolution of overloading, kind inference (including defaulting) and polymorphic recursion, the only major omission being a proper treatment of ambiguous overloading and its resolution.

Citations

253	Interpretation fonctionelle et elimination des coupures de l’arithmetique d’ordre superieur. These d’Etat - Girard - 1972
171	A system of constructor classes: overloading and implicit higher-order polymorphism - Jones - 1993
159	Lambda lifting: Transforming programs to recursive equations - Johnsson - 1985
13	Report on the programming language Haskell 98. Available from the Haskell homepage: http://www.haskell.org - Jones, Hughes - 1999
9	Type classes: an exploration of the design space. Haskell workshop - Jones, Simon, et al. - 1997
9	Towards a theory of type structure. Pages 408-425 of: Colloque sur la programmation - Reynolds - 1974
7	Type recursion in the presence of polymorphic recursion - Kfoury, Tiuryn, et al. - 1993
4	editors): Report on the Programming Language Haskell, a Non-Strict Purely - Wadler - 1992
2	Message to the Haskell mailing list - Hughes - 2001
1	Type classes in Haskell. Transactions on programming languages and systems - Hall, Hammond, et al. - 1996
1	Typing Haskell in Haskell. Proceedings of the third Haskell workshop. Available from www.cse.ogi.edu/~mpj/thih - Jones - 1999