3001 search results - page 69 / 601 » Recursive type generativity |
TLCA
2005
Springer
15 years 5 months ago
2005
Springer
We use a fully abstract denotational model to show that nested function calls and recursive definitions can be eliminated from SPCF (a typed functional language with simple non-lo...
FOCS
1998
IEEE
15 years 4 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...
ICFP
2006
ACM
15 years 12 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 4 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 ...
GI
2004
Springer
15 years 5 months ago
2004
Springer
: There is an emerging amount of software for generating and manipulating XML documents. This paper addresses the problem of guaranteeing the validity of dynamically generated XML ...