Sciweavers

4757 search results - page 33 / 952
» Monads for Functional Programming
Sort
View
POPL
2010
ACM
15 years 9 months ago
Structuring the verification of heap-manipulating programs
Most systems based on separation logic consider only restricted forms of implication or non-separating conjunction, as full support for these connectives requires a non-trivial no...
Aleksandar Nanevski, Josh Berdine, Viktor Vafeiadi...
ICFP
2004
ACM
15 years 11 months ago
Searching for deadlocks while debugging concurrent haskell programs
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...
Jan Christiansen, Frank Huch
APLAS
2003
ACM
15 years 5 months ago
A Program Inverter for a Functional Language with Equality and Constructors
We present a method for automatic program inversion in a first-order functional programming language. We formalize the transformation and illustrate it with several examples inclu...
Robert Glück, Masahiko Kawabe