JUCS - Journal of Universal Computer Science 9(8): 873-890, doi: 10.3217/jucs-009-08-0873
Practical Type Inference for Polymorphic Recursion: an Implementation in Haskell
expand article infoCristiano Vasconcellos‡, Lucília Figueiredo§, Carlos Camarão|
‡ Pontifícia Universidade Católica do Paraná, Brazil§ Universidade Federal de Ouro Preto, Brazil| Universidade Federal de Minas Gerais, Brazil

Corresponding author: Cristiano Vasconcellos ( damiani@ppgia.pucpr.br )

© Cristiano Vasconcellos, Lucília Figueiredo, Carlos Camarão.
This article is freely available under the J.UCS Open Content License.
Citation: Vasconcellos C, Figueiredo L, Camarão C (2003) Practical Type Inference for Polymorphic Recursion: an Implementation in Haskell. JUCS - Journal of Universal Computer Science 9(8): 873-890. https://doi.org/10.3217/jucs-009-08-0873
Open Access
Abstract
This paper describes a practical type inference algorithm for typing poly-morphic and possibly mutually recursive definitions, using Haskell to provide a high-level implementation of the algorithm.
Keywords
programming languages, type inference, polymorphic recursion