%0 Conference Paper
%B Proceedings of 8th European Symposium on Programming Languages and Systems - ESOP
%D 1999
%T Constructor Subtyping
%A Gilles Barthe
%A Maria João Frade
%C Amsterdam, The Netherlands
%I Springer
%P 109-127
%S Lecture Notes in Computer Science
%V 1576
%X <p>Constructor subtyping is a form of subtyping in which an inductive type A is viewed as a subtype of another inductive type B if B has more constructors than A. Its (potential) uses include proof assistants and functional programming languages. In this paper, we introduce and study the properties of a simply typed lambda-calculus with record types and datatypes, and which supports record subtyping and constructor subtyping. In the first part of the paper, we show that the calculus is confluent and strongly normalizing. In the second part of the paper, we show that the calculus admits a well-behaved theory of canonical inhabitants, provided one adopts expansive extensionality rules, including eta-expansion, surjective pairing, and a suitable expansion rule for datatypes. Finally, in the third part of the paper, we extend our calculus with unbounded recursion and show that confluence is preserved.</p>
%8 March
%> https://haslab.uminho.pt/sites/default/files/mjf/files/esop99.pdf