Sciweavers

709 search results - page 34 / 142
» An Equational Theory for Transactions
Sort
View
MCMASTER
1993
15 years 3 months ago
A Taste of Rewrite Systems
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...
Nachum Dershowitz
BIRTHDAY
2006
Springer
15 years 2 months ago
Some Varieties of Equational Logic
d Abstract) Gordon Plotkin1, LFCS, School of Informatics, University of Edinburgh, UK. The application of ideas from universal algebra to computer science has long been a major the...
Gordon D. Plotkin
EUROPAR
2003
Springer
15 years 4 months ago
RECSY - A High Performance Library for Sylvester-Type Matrix Equations
In this presentation, we give an overview of research activities at the Department of Computing Science, Ume˚a University with focus on Scientific, Parallel and High-Performance...
Isak Jonsson, Bo Kågström
LICS
2000
IEEE
15 years 3 months ago
Complete Axioms for Categorical Fixed-Point Operators
We give an axiomatic treatment of fixed-point operators in categories. A notion of iteration operator is defined, embodying the equational properties of iteration theories. We p...
Alex K. Simpson, Gordon D. Plotkin
66
Voted
POPL
2010
ACM
15 years 8 months ago
Coarse-Grained Transactions
Traditional transactional memory systems suffer from overly conservative conflict detection, yielding so-called false conflicts, because they are based on fine-grained, low-level ...
Eric Koskinen, Matthew Parkinson, Maurice Herlihy