8 search results - page 1 / 2 » A concurrent constraint handling rules implementation in Has... |
POPL
2007
ACM
14 years 5 months ago
2007
ACM
Constraint Handling Rules (CHR) is a concurrent committedchoice constraint logic programming language to describe transformations (rewritings) among multi-sets of constraints (ato...
POPL
2009
ACM
13 years 11 months ago
2009
ACM
Haskell has a rich set of synchronization primitives for implemented-state concurrency abstractions, ranging from the very high level (Software Transactional Memory) to the very l...
HASKELL
2009
ACM
13 years 11 months ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
FLOPS
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. This paper explores the feasibility of re-expressing concurrent algorithms with explicit locks in terms of lock free code written using Haskell's implementation of s...
IPPS
2010
IEEE
13 years 2 months ago
2010
IEEE
Abstract--Ensuring the correctness of complex implementations of software transactional memory (STM) is a daunting task. Attempts have been made to formally verify STMs, but these ...