Typing polymorphic recursion
Year: 2001
Type: conference-paper
Abstract: 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.
Authors: Lucília Figueiredo, Carlos Camarão
Language: Spanish
Subfield: Software
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1563270810
