2373 search results - page 7 / 475 » On the Theory of Structural Subtyping |
JFP
2002
14 years 9 months ago
2002
Algorithms for checking subtyping between recursive types lie at the core of many programming language implementations. But the fundamental theory of these algorithms and how they...
114
click to vote
LICS
1997
IEEE
15 years 1 months ago
1997
IEEE
A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0, if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0. ...
ECOOP
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. In many domains, classes have highly regular internal structure. For example, so-called business objects often contain boilerplate code for mapping database fields to cl...
TACS
1991
Springer
15 years 1 months ago
1991
Springer
System F is a well-known typed λ-calculus with polymorphic types, which provides a basis for polymorphic programming languages. We study an extension of F, called F<: (pronoun...
103
click to vote
TPHOL
1998
IEEE
15 years 1 months ago
1998
IEEE
We show how extensible records with structural subtyping can be represented directly in Higher-Order Logic (HOL). Exploiting some specific properties of HOL, this encoding turns o...