Sciweavers

4757 search results - page 36 / 952
» Monads for Functional Programming
Sort
View
POS
1994
Springer
13 years 11 months ago
Hardware Support for Stability in a Persistent Architecture
Persistent stores support uniform management of data objects regardless of their lifetimes and locations. Such stores typically maintain a self-consistent state even after failure...
Frans A. Henskens, D. M. Koch, Rasool Jalili, John...
ICALP
1995
Springer
13 years 11 months ago
Parallel Algorithms with Optimal Speedup for Bounded Treewidth
We describe the rst parallel algorithm with optimal speedup for constructing minimum-width tree decompositions of graphs of bounded treewidth. On n-vertex input graphs, the algori...
Hans L. Bodlaender, Torben Hagerup
ICFP
2010
ACM
13 years 8 months ago
Total parser combinators
A monadic parser combinator library which guarantees termination of parsing, while still allowing many forms of left recursion, is described. The library's interface is simil...
Nils Anders Danielsson
APPINF
2003
13 years 9 months ago
Why Functional Programming Really Matters
The significance of functional programming is revealed as that the feasible approach to language extensibility which it enables is further applicable to programming in general and...
Paul A. Bailes, Colin J. M. Kemp, Ian Peake, Sean ...
FPCA
1995
13 years 11 months ago
The Functional Side of Logic Programming
In this paper we study the relationships between logic programming and functional programming, trying to answer the following basic question: to what extent is logic programming j...
Massimo Marchiori