316 search results - page 21 / 64 » Subtyping Union Types |
66
Voted
IFL
2001
Springer
15 years 2 months ago
2001
Springer
A programming language with subtyping can be translated into a language without subtyping by inserting conversion functions. Previous studies of this interpretation showed only the...
117
Voted
POPL
1995
ACM
15 years 1 months ago
1995
ACM
We show how a set of building blocks can be used to construct programming language interpreters, and present implementations of such building blocks capable of supporting many com...
104
click to vote
CSL
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. We present a new proof of decidability of higher-order subtyping in the presence of bounded quantification. The algorithm is formulated as a judgement which operates on b...
180
Voted
ECOOP
2009
Springer
15 years 10 months ago
2009
Springer
We propose a novel approach based on coinductive logic to specify type systems of programming languages. The approach consists in encoding programs in Horn formulas which are inter...
TLCA
1993
Springer
15 years 1 months ago
1993
Springer
d abstract) Giorgio Ghelli1 F≤ is a type system used to study the integration of inclusion and parametric polymorphism. F≤ does not include a notion of recursive types, but ext...