Typing polymorphic recursion
This paper discusses some advantages of supporting polymorphic recursión in programming languages and describes a decidable type inference algorithm for typing polymorphic and possibly mutually recursive definitions, using Haskell to provide an executable high level specification of the algorithm.
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2001
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/23287 |
| Aporte de: |
| Sumario: | This paper discusses some advantages of supporting polymorphic recursión in programming languages and describes a decidable type inference algorithm for typing polymorphic and possibly mutually recursive definitions, using Haskell to provide an executable high level specification of the algorithm. |
|---|