CORR
2004
Springer
13 years 4 months ago
2004
Springer
We show that the first-order theory of structural subtyping of non-recursive types is decidable. Let be a language consisting of function symbols (representing type constructors)...
ECOOP
2008
Springer
13 years 6 months ago
2008
Springer
Nominal and structural subtyping each have their own strengths and weaknesses. Nominal subtyping allows programmers to explicitly express design intent, and, when types are associa...
TPHOL
1998
IEEE
13 years 8 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...
LICS
2003
IEEE
13 years 9 months ago
2003
IEEE
We show that the first-order theory of structural subtyping of non-recursive types is decidable, as a consequence of a more general result on the decidability of term powers of d...
OOPSLA
2007
Springer
13 years 10 months ago
2007
Springer
Nominal subtyping (or user-defined subtyping) and structural subtyping each have their own strengths and weaknesses. Nominal subtyping allows programmers to explicitly express de...
ESOP
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. Structural subtyping is popular in research languages, but all mainstream object-oriented languages use nominal subtyping. Since languages with structural subtyping are n...