Type Inference for Bimorphic Recursion

This paper proposes bimorphic recursion, which is restricted polymorphic recursion such that every recursive call in the body of a function definition has the same type. Bimorphic recursion allows us to assign two different types to a recursively defined function: one is for its recursive calls and...

Full description

Bibliographic Details
Main Authors: Makoto Tatsuta, Ferruccio Damiani
Format: Article
Language:English
Published: Open Publishing Association 2011-06-01
Series:Electronic Proceedings in Theoretical Computer Science
Online Access:http://arxiv.org/pdf/1106.1234v1

Similar Items