Results 1 -
1 of
1
Practical Type Inference for Polymorphic Recursion: an Implementation in Haskell
- Journal of Universal Computer Science
"... Abstract. This paper describes a practical type inference algorithm for typing polymorphic and possibly mutually recursive definitions, using Haskell to provide a high-level implementation of the algorithm. ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Abstract. This paper describes a practical type inference algorithm for typing polymorphic and possibly mutually recursive definitions, using Haskell to provide a high-level implementation of the algorithm.

