The Community for Technology Leaders
Logic in Computer Science, Symposium on (1999)
Trento, Italy
July 2, 1999 to July 5, 1999
ISSN: 1043-6871
ISBN: 0-7695-0158-3
pp: 137
Dario Colazzo , University of Pisa
Giorgio Ghelli , University of Pisa
ABSTRACT
The problem of defining and checking a subtype relation between recursive types was studied by Amadio and Cardelli (ACM TOPLAS'93) for a first order type system, but for second order systems, which combine subtyping and parametric polymorphism, only negative results are known (Ghelli, TLCA'93).This paper studies the problem of subtype checking for recursive types in system kernel Fun, a typed lambda-calculus with subtyping and bounded second order polymorphism.Along the lines of Amadio-Cardelli, we study the definition of a subtype relation over kernel Fun recursive types, and then we present a subtyping algorithm which is sound and complete with respect to this relation. We show that the natural extension of the techniques introduced by Amadio and Cardelli to compare first order recursive types gives a non complete algorithm. We prove the completeness and correctness of a different algorithm, which also admits an efficient implementation.
INDEX TERMS
type theory and type systems, subtyping, recursive types, kernel Fun
CITATION

D. Colazzo and G. Ghelli, "Subtyping Recursive Types in Kernel Fun - Abstract," Logic in Computer Science, Symposium on(LICS), Trento, Italy, 1999, pp. 137.
doi:10.1109/LICS.1999.782605
87 ms
(Ver 3.3 (11022016))