16 search results - page 3 / 4 » Lock Free Data Structures Using STM in Haskell |
WDAG
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. First-in-first-out (FIFO) queues are among the most fundamental and highly studied concurrent data structures. The most effective and practical dynamic-memory concurren...
PLDI
2012
ACM
11 years 8 months ago
2012
ACM
We describe an approach for synthesizing data representations for concurrent programs. Our compiler takes as input a program written using concurrent relations and synthesizes a r...
ICFP
2005
ACM
14 years 6 months ago
2005
ACM
Recent research has shown how boilerplate code, or repetitive code for traversing datatypes, can be eliminated using generic programming techniques already available within some i...
TLDI
2003
ACM
13 years 11 months ago
2003
ACM
We describe a design pattern for writing programs that traverse data structures built from rich mutually-recursive data types. Such programs often have a great deal of “boilerpl...
ASPLOS
2011
ACM
12 years 9 months ago
2011
ACM
nt, user-defined objects present an attractive abstraction for working with non-volatile program state. However, the slow speed of persistent storage (i.e., disk) has restricted ...