Sciweavers

596 search results - page 100 / 120
» Subtyping Recursive Types
Sort
View
84
Voted
POPL
1998
ACM
15 years 4 months ago
A Functional Representation of Data Structures with a Hole
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...
Yasuhiko Minamide
TAPSOFT
1993
Springer
15 years 3 months ago
Optimal Reductions in Interaction Systems
Lamping's optimalgraph reduction technique for the -calculus is generalized to a new class of higher order rewriting systems, called Interaction Systems. Interaction Systems ...
Andrea Asperti, Cosimo Laneve
SWAT
1992
Springer
116views Algorithms» more  SWAT 1992»
15 years 3 months ago
Sorting Multisets Stably in Minimum Space
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...
Jyrki Katajainen, Tomi Pasanen
ADC
2006
Springer
119views Database» more  ADC 2006»
15 years 3 months ago
Using reflection for querying XML documents
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...
Markus Kirchberg, Faizal Riaz-ud-Din, Klaus-Dieter...
CSL
2006
Springer
15 years 3 months ago
Universality Results for Models in Locally Boolean Domains
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 ...
Tobias Löw, Thomas Streicher