596 search results - page 21 / 120 » Subtyping Recursive Types |
177
click to vote
ICDE
1995
IEEE
16 years 1 months ago
1995
IEEE
The model of flexible relations supports heterogeneous sets of tuples in a strongly typed way. The elegance of the standard relational model is preserved by using a single, generi...
IFL
2001
Springer
15 years 4 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...
ENTCS
2007
14 years 11 months ago
2007
This paper is concerned with a proof-theoretic observation about two kinds of proof systems for regular cyclic objects. It is presented for the case of two formal systems that are...
118
click to vote
CSL
2008
Springer
15 years 1 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...
111
click to vote
ICFP
2007
ACM
15 years 11 months ago
2007
ACM
There has been much work in recent years on extending ML with recursive modules. One of the most difficult problems in the development of such an extension is the double vision pr...