Simple, Decidable Type Inference with Subtyping

Details Simple, Decidable Type Inference with Subtyping Simple, Decidable Type Inference with Subtyping

2011-04-15

arxiv.org/abs/1104.3116v1

Computer Science

Programming Languages

Scientific paper

We demonstrate a method to infer polymorphically principal and subtyping-minimal types for an ML-like core language by assigning ranges within a lattice to type variables. We demonstrate the termination and completeness of this algorithm, and proceed to show that it solves a broad special-case of the generally-undecidable semi-unification problem. Our procedure requires no type annotations, leaves no subtyping constraints in the inferred types, and produces no proof obligations. We demonstrate the practical utility of our technique by showing a type-preserving encoding of Featherweight Java into the expression calculus over which we infer types.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-9295