Type Inference for Bimorphic Recursion

Details Type Inference for Bimorphic Recursion Type Inference for Bimorphic Recursion

2011-06-07

arxiv.org/abs/1106.1234v1

EPTCS 54, 2011, pp. 102-115

Computer Science

Logic in Computer Science

In Proceedings GandALF 2011, arXiv:1106.0814

Scientific paper

10.4204/EPTCS.54.8

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 the other is for its calls outside its definition. Bimorphic recursion in this paper can be nested. This paper shows bimorphic recursion has principal types and decidable type inference. Hence bimorphic recursion gives us flexible typing for recursion with decidable type inference. This paper also shows that its typability becomes undecidable because of nesting of recursions when one removes the instantiation property from the bimorphic recursion.

Affiliated with

Also associated with

No associations

Rating

Type Inference for Bimorphic Recursion does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Type Inference for Bimorphic Recursion, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Type Inference for Bimorphic Recursion will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-25263