Practical Type Inference for Polymorphic Recursion: an Implementation in Haskell
Cristiano Vasconcellos (Pontifícia Universidade Católica do Paraná, Brazil)
Lucília Figueiredo (Universidade Federal de Ouro Preto, Brazil)
Carlos Camarão (Universidade Federal de Minas Gerais, Brazil)
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: polymorphic recursion, programming languages, type inference
Categories: D.3, D.3.3
|