Sciweavers

478 search results - page 25 / 96
» Monads of Regular Theories
Sort
View
71
Voted
FCS
2006
15 years 10 days ago
Naming and its Regularities in Distributed Environments
: Many of the Internet's problems are related to names. There are many empirical ideas of the further development of naming on the Internet. However, there are no theoretical ...
Mark Burgin, Anshul Taldon
80
Voted
ICIAR
2007
Springer
15 years 5 months ago
Parameterless Discrete Regularization on Graphs for Color Image Filtering
A discrete regularization framework on graphs is proposed and studied for color image filtering purposes when images are represented by grid graphs. Image filtering is considered...
Olivier Lezoray, Sébastien Bougleux, Abderr...
123
Voted
HASKELL
2009
ACM
15 years 5 months ago
A compositional theory for STM Haskell
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...
Johannes Borgström, Karthikeyan Bhargavan, An...
108
Voted
CORR
2004
Springer
176views Education» more  CORR 2004»
14 years 10 months ago
The First-Order Theory of Sets with Cardinality Constraints is Decidable
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
Viktor Kuncak, Martin C. Rinard
80
Voted
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