Subtyping for F-Bounded Quantifiers and Equirecursive Types (Extended Version)

Details Subtyping for F-Bounded Quantifiers and Equirecursive Types (Extended Version) Subtyping for F-Bounded Quantifiers and Equirecursive Types (Extended Version)

2012-02-12

arxiv.org/abs/1202.2486v1

Computer Science

Programming Languages

Scientific paper

This paper defines a notion of binding trees that provide a suitable model for second-order type systems with F-bounded quantifiers and equirecursive types. It defines a notion of regular binding trees that correspond in the right way to notions of regularity in the first-order case. It defines a notion of subtyping on these trees and proves various properties of the subtyping relation. It defines a mapping from types to trees and shows that types produce regular binding trees. It presents a set of type equality and subtyping rules, and proves them sound and complete with respect to the tree interpretation. It defines a notion of binding-tree automata and how these generate regular binding trees. It gives a polynomial-time algorithm for deciding when two automata's trees are in the subtyping relation.

Affiliated with

Also associated with

No associations

Rating

Subtyping for F-Bounded Quantifiers and Equirecursive Types (Extended Version) 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 Subtyping for F-Bounded Quantifiers and Equirecursive Types (Extended Version), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Subtyping for F-Bounded Quantifiers and Equirecursive Types (Extended Version) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-371428