Sciweavers

4757 search results - page 346 / 952
» Monads for Functional Programming
Sort
View
PLDI
2010
ACM
16 years 4 months ago
Ur: Statically-Typed Metaprogramming with Type-Level Record Computation
Dependent types provide a strong foundation for specifying and verifying rich properties of programs through type-checking. The earliest implementations combined dependency, which...
Adam Chlipala
SAC
2009
ACM
16 years 1 months ago
A comparative study of techniques to write customizable libraries
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...
Baris Aktemur, Sam Kamin
EVOW
1994
Springer
15 years 10 months ago
Genetic Approaches to Learning Recursive Relations
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...
Peter A. Whigham, Robert I. McKay
ICFP
2010
ACM
15 years 7 months ago
Scrapping your inefficient engine: using partial evaluation to improve domain-specific language implementation
Partial evaluation aims to improve the efficiency of a program by specialising it with respect to some known inputs. In this paper, we show that partial evaluation can be an effec...
Edwin Brady, Kevin Hammond
POPL
2007
ACM
16 years 7 months ago
Lightweight fusion by fixed point promotion
This paper proposes a lightweight fusion method for general recursive function definitions. Compared with existing proposals, our method has several significant practical features...
Atsushi Ohori, Isao Sasano