Objeto de conferencia
Typing polymorphic recursion
Registro en:
Autor
Figueiredo, Lucília Camarão de
Camarão, Carlos
Institución
Resumen
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. Eje: Informática teórica Red de Universidades con Carreras en Informática (RedUNCI)