4 search results - page 1 / 1 » Reinventing Haskell Backtracking |
GI
2009
Springer
13 years 9 months ago
2009
Springer
: Almost ten years ago, Ralf Hinze has written a functional pearl on how to derive backtracking functionality for the purely functional programming language Haskell. In these notes...
ICFP
2004
ACM
14 years 4 months ago
2004
ACM
This paper presents an approach to searching for deadlocks in Concurrent Haskell programs. The search is based on a redefinition of the IO monad which allows the reversal of Concu...
ICSE
2009
IEEE-ACM
14 years 5 months ago
2009
IEEE-ACM
Superimposition is a composition technique that has been applied successfully in many areas of software development. Although superimposition is a general-purpose concept, it has ...
ICFP
2007
ACM
14 years 4 months ago
2007
ACM
We present a pair of reasoning principles, definition and proof by rigid induction, which can be seen as proper generalizations of lazy-datatype induction to monadic effects other...