3001 search results - page 105 / 601 » Recursive type generativity |
118
Voted
SAS
1993
Springer
15 years 6 months ago
1993
Springer
A new construction of a finite set of strictness properties for any lazy algebraic datatype is presented. The construction is based on the categorical view of the solutions to the...
101
Voted
ENTCS
2008
15 years 2 months ago
2008
: Countably based filter spaces have been suggested in the 1970's as a model for recursion theory on higher types. Weak limit spaces with a countable base are known to be the ...
142
click to vote
ENTCS
2007
15 years 2 months ago
2007
syntax and explicit substitutions Brigitte Pientka1 School of Computer Science McGill University Montreal, Canada This paper sketches a foundation for programming with higher-orde...
110
Voted
ICSE
2005
IEEE-ACM
16 years 2 months ago
2005
IEEE-ACM
When building scalable systems that involve general-purpose computation and persistent data, object-oriented languages and relational databases are often essential components. Yet...
125
click to vote
ACNS
2010
Springer
15 years 7 months ago
2010
Springer
To this day, realizations in the standard-model of (lossy) trapdoor functions from discrete-log-type assumptions require large public key sizes, e.g., about Θ(λ2 ) group elements...