A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Abstract data type systems
1997
Theoretical Computer Science
This paper is concerned with the foundations of an extension of pure type systems by abstract data types, hence the name of Abstract Dutu Type Systems. ADTS generalize inductive types as they are defined in the calculus of constructions, by providing definitions of functions by pattern matching on the one hand, and relations among constructors of the inductive type on the other. It also generalizes the first-order framework of abstract data types by providing function types and higher-order
doi:10.1016/s0304-3975(96)00161-2
fatcat:xmdsq2sawjgyfdv2k47npicjjm