596 search results - page 78 / 120 » Subtyping Recursive Types |
107
click to vote
FOCS
1998
IEEE
15 years 5 months ago
1998
IEEE
We present a higher-order functional notation for polynomial-time computation with arbitrary 0; 1-valued oracle. This provides a linguistic characterization for classes such as np...
102
click to vote
ICFP
2006
ACM
16 years 1 months ago
2006
ACM
"Generics for the Masses" (GM) and "Scrap your Boilerplate" (SYB) are generic programming approaches based on some ingenious applications of Haskell type class...
ICALP
1990
Springer
15 years 5 months ago
1990
Springer
A system of hierarchical, fully recursive types in a truly imperative language allows program fragments written for small types to be reused for all larger types. To exploit this ...
JFP
2006
15 years 1 months ago
2006
A part of a query that will never contribute data to the query answer should be regarded as an error. This principle has been recently accepted into mainstream XML query languages...
LICS
2007
IEEE
15 years 7 months ago
2007
IEEE
We introduce a computable framework for Lebesgue’s measure and integration theory in the spirit of domain theory. For an effectively given second countable locally compact Hausd...