9405 search results - page 29 / 1881 » Computing a Model of Set Theory |
118
click to vote
HASKELL
2009
ACM
15 years 4 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...
AAAI
2007
15 years 3 days ago
2007
JMLR
2006
14 years 9 months ago
2006
CORR
2007
Springer
14 years 9 months ago
2007
Springer
We give a simple order-theoretic construction of a Cartesian closed category of sequential functions. It is based on bistable biorders, which are sets with a partial order — the ...
INFORMATICALT
2010
14 years 7 months ago
2010
The Turing machine is one of the simple abstract computational devices that can be used to investigate the limits of computability. In this paper, they are considered from several ...