255 search results - page 24 / 51 » Synthesis of Functions Using Generic Programming |
129
Voted
OOPSLA
2010
Springer
15 years 18 days ago
2010
Springer
Type classes were originally developed in Haskell as a disciplined alternative to ad-hoc polymorphism. Type classes have been shown to provide a type-safe solution to important ch...
116
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
A string matching--and more generally, sequence matching--algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of compari...
181
Voted
SAGA
2009
Springer
15 years 8 months ago
2009
Springer
We propose a generic method for obtaining quickly good upper bounds on the minimal value of a multistage stochastic program. The method is based on the simulation of a feasible dec...
110
Voted
ACSC
2006
IEEE
15 years 8 months ago
2006
IEEE
Manipulating semistructured data, such as XML, does not t well within conventional programming languages. A typical manipulation requires nding all occurrences of a structure matc...
130
click to vote
FPCA
1995
15 years 5 months ago
1995
In functional programming, intermediate data structures are often used to “glue’) together small programs. Deforestation is a program transformation to remove these intermedia...