Type Inference for Guarded Recursive Data Types

Details Type Inference for Guarded Recursive Data Types Type Inference for Guarded Recursive Data Types

2005-07-14

arxiv.org/abs/cs/0507037v1

Computer Science

Programming Languages

Scientific paper

We consider type inference for guarded recursive data types (GRDTs) -- a recent generalization of algebraic data types. We reduce type inference for GRDTs to unification under a mixed prefix. Thus, we obtain efficient type inference. Inference is incomplete because the set of type constraints allowed to appear in the type system is only a subset of those type constraints generated by type inference. Hence, inference only succeeds if the program is sufficiently type annotated. We present refined procedures to infer types incrementally and to assist the user in identifying which pieces of type information are missing. Additionally, we introduce procedures to test if a type is not principal and to find a principal type if one exists.

Affiliated with

Also associated with

No associations

Rating

Type Inference for Guarded Recursive Data Types 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 Guarded Recursive Data Types, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Type Inference for Guarded Recursive Data Types will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-575021