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: | Figueiredo, Lucília Camarão de, Camarão, Carlos |
---|---|
Formato: | Objeto de conferencia |
Lenguaje: | Inglés |
Publicado: |
2001
|
Materias: | |
Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/23287 |
Aporte de: |
Ejemplares similares
-
Implementing a typed assembly language and its machine model
por: Medel, Ricardo, et al.
Publicado: (2002) -
An inference mechanism for question answering
por: Roger, Sandra, et al.
Publicado: (2007) -
JEDI: An interactive interpreter for JAVA
por: Rodrigues, Hermann Oliveira, et al.
Publicado: (2001) -
Ecient type checking for path polymorphism
Publicado: (2018) -
Ecient type checking for path polymorphism
por: Edi, J., et al.