5863 search results - page 437 / 1173 » Calculating Functional Programs |
143
click to vote
JCT
2006
15 years 6 months ago
2006
Let Ng(f ) denote the number of rooted maps of genus g having f edges. An exact formula for Ng(f ) is known for g = 0 (Tutte, 1963), g = 1 (Arques, 1987), g = 2,3 (Bender and Canf...
192
click to vote
PLDI
2010
ACM
16 years 4 months ago
2010
ACM
Dependent types provide a strong foundation for specifying and verifying rich properties of programs through type-checking. The earliest implementations combined dependency, which...
177
click to vote
POPL
2010
ACM
16 years 4 months ago
2010
ACM
In functional programming, monadic characterizations of computational effects are normally understood denotationally: they describe how an effectful program can be systematically ...
157
click to vote
SAC
2009
ACM
16 years 1 months ago
2009
ACM
Code libraries are characterized by feature-richness — and, consequently, high overhead. The library specialization problem is the problem of obtaining a low-overhead version of...
206
click to vote
EVOW
1994
Springer
15 years 11 months ago
1994
Springer
The genetic programming (GP) paradigm is a new approach to inductively forming programs that describe a particular problem. The use of natural selection based on a fitness ]unction...