596 search results - page 69 / 120 » Subtyping Recursive Types |
117
click to vote
CSL
2007
Springer
15 years 7 months ago
2007
Springer
Normal form bisimulation is a powerful theory of program equivalence, originally developed to characterize L´evy-Longo tree equivalence and Boehm tree equivalence. It has been ada...
ESOP
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Two of the most prominent features of ML are its expressive module system and its support for Damas-Milner type inference. However, while the foundations of both these fe...
110
click to vote
ECOOP
2010
Springer
15 years 6 months ago
2010
Springer
Data-centric synchronization groups fields of objects into atomic sets to indicate they must be updated atomically. Each atomic set has associated units of work, code fragments th...
115
click to vote
CORR
2007
Springer
15 years 1 months ago
2007
Springer
We present algorithms for the discrete cosine transform (DCT) and discrete sine transform (DST), of types II and III, that achieve a lower count of real multiplications and additi...
108
click to vote
CORR
2007
Springer
15 years 1 months ago
2007
Springer
We present algorithms for the type-IV discrete cosine transform (DCT-IV) and discrete sine transform (DST-IV), as well as for the modified discrete cosine transform (MDCT) and it...