论文信息 - Typing Haskell in Haskell

Typing Haskell in Haskell

Haskell benefits from a sophisticated type system, but implementors, programmers, and researchers suffer because it has no formal description. To remedy this shortcoming, we present a Haskell program that implements a Haskell typechecker, thus providing a mathematically rigorous specification in a notation that is familiar to Haskell users. We expect this program to fill a serious gap in current descriptions of Haskell, both as a starting point for discussions about existing features of the type system, and as a platform from which to explore new proposals.

Mark P. Jones | Mark P. Jones

[1] J. A. Robinson,et al. A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[2] Benedict R. Gaster,et al. A Polymorphic Type System for Extensible Records and Variants , 1996 .

[3] Philip Wadler,et al. The essence of functional programming , 1992, POPL '92.

[4] R. Hindley. The Principal Type-Scheme of an Object in Combinatory Logic , 1969 .

[5] Mark P. Jones. Qualified Types: Theory and Practice , 1994 .

[6] Simon L. Peyton Jones,et al. Report on the programming language Haskell: a non-strict, purely functional language version 1.2 , 1992, SIGP.

[7] Robin Milner,et al. Principal type-schemes for functional programs , 1982, POPL '82.

[8] Philip Wadler,et al. The essence of functional programming (Invited talk) , 1997 .

[9] Ralf Hinze,et al. Haskell 98 — A Non−strict‚ Purely Functional Language , 1999 .

[10] Stephen Blott. An approach to overloading with polymorphism , 1991 .

[11] Robin Milner,et al. A Theory of Type Polymorphism in Programming , 1978, J. Comput. Syst. Sci..

[12] Fritz Henglein,et al. Type inference with polymorphic recursion , 1993, TOPL.

[13] Jerzy Tiuryn,et al. Type reconstruction in the presence of polymorphic recursion , 1993, TOPL.

[14] Philip Wadler,et al. How to make ad-hoc polymorphism less ad hoc , 1989, POPL '89.

[15] John Hughes,et al. Report on the Programming Language Haskell 98 , 1999 .