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...
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...
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...
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 ...
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...