56 search results - page 3 / 12 » Polymorphic subtyping in O'Haskell |
FLOPS
2004
Springer
14 years 27 days ago
2004
Springer
Restricting polymorphism to values is now the standard way to obtain soundness in ML-like programming languages with imperative features. While this solution has undeniable advant...
POPL
2006
ACM
14 years 7 months ago
2006
ACM
We propose a type system based on regular tree grammars, where algebraic datatypes are interpreted in a structural way. Thus, the same constructors can be reused for different typ...
CSL
2004
Springer
14 years 28 days ago
2004
Springer
Subtyping rules can be fairly complex for union types, due to interactions with other types, such as function types. Furthermore, these interactions turn out to depend on the calc...
TPHOL
1998
IEEE
13 years 11 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...
MSCS
2008
13 years 7 months ago
2008
The idea of coercive subtyping, a theory of abbreviation for dependent type theories, is incorporated into the polymorphic type system in functional programming languages. The tra...