596 search results - page 100 / 120 » Subtyping Recursive Types |
137
click to vote
POPL
1998
ACM
15 years 10 months ago
1998
ACM
Data structures with a hole, in other words data structures with an uninitialized field, are useful to write efficient programs: they enable us to construct functional data stru...
157
click to vote
TAPSOFT
1993
Springer
15 years 10 months ago
1993
Springer
Lamping's optimalgraph reduction technique for the -calculus is generalized to a new class of higher order rewriting systems, called Interaction Systems. Interaction Systems ...
140
click to vote
SWAT
1992
Springer
15 years 10 months ago
1992
Springer
Abstract. In a decision tree model, (n log2 n m i=1 ni log2 ni + n) is known to be a lower bound for sorting a multiset of size n containing m distinct elements, where the ith dist...
159
click to vote
ADC
2006
Springer
15 years 9 months ago
2006
Springer
XML-based databases have become a major area of in database research. Abstractly speaking they can be considered as a resurrection of complexvalue databases using constructors for...
119
click to vote
CSL
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. In [6] J. Laird has shown that an infinitary sequential extenPCF has a fully abstract model in his category of locally boolean domains (introduced in [8]). In this paper ...