4757 search results - page 134 / 952 » Monads for Functional Programming |
121
click to vote
ICFP
2004
ACM
16 years 2 months ago
2004
ACM
Among slide-presentation systems, the dominant application offers lly no abstraction capability. Slideshow, an extension of PLT Scheme, represents our effort over the last several...
136
Voted
SODA
2010
ACM
16 years 1 days ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
120
Voted
JUCS
2008
15 years 2 months ago
2008
: This paper describes the development of an Intellectual Property (IP) core in VHDL able to implement a Multilayer Perceptron (MLP) artificial neural network (ANN) topology with u...
79
Voted
BIRTHDAY
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. We present a general methodology for non-deterministic programming based on pure functional programming. We construct families of automata constructions which are used as...
128
click to vote
PPDP
2009
Springer
15 years 9 months ago
2009
Springer
“Scrap Your Boilerplate” (SYB) is an established style of generic functional programming. The present paper reconstructs SYB within the Prolog language with the help of the un...