518 search results - page 30 / 104 » Automating Proofs in Category Theory |
111
Voted
PLPV
2009
ACM
15 years 8 months ago
2009
ACM
We propose a new way to reason about general recursive functional programs in the dependently typed programming language Agda, which is based on Martin-L¨of’s intuitionistic ty...
103
click to vote
CGO
2010
IEEE
15 years 6 months ago
2010
IEEE
Reducing the arithmetic precision of a computation has real performance implications, including increased speed, decreased power consumption, and a smaller memory footprint. For s...
KR
1989
Springer
15 years 3 months ago
1989
Springer
Research on nonmonotonic and default reasoning has identified several important criteria for preferring alternative default inferences. The theories of reasoning based on each of...
73
Voted
FSTTCS
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. Transactions are commonly described as being ACID: Allor-nothing, Consistent, Isolated and Durable. However, although these words convey a powerful intuition, the ACID pr...
100
click to vote
LPAR
2007
Springer
15 years 5 months ago
2007
Springer
Sequence logic is a parameterized logic where the formulas are sequences of formulas of some arbitrary underlying logic. The sequence formulas are interpreted in certain linearly o...