793 search results - page 59 / 159 » Argumentation and standards of proof |
158
click to vote
TACAS
2010
Springer
16 years 1 months ago
2010
Springer
Many algorithms on data structures such as terms (finitely branching trees) are naturally implemented by second-order recursion: A first-order procedure f passes itself as an arg...
135
click to vote
CSL
2009
Springer
16 years 22 days ago
2009
Springer
We investigate the relationship between two independently developed termination techniques for rst and higher-order rewrite systems. On the one hand, sized-types based termination...
170
click to vote
APLAS
2009
ACM
16 years 20 days ago
2009
ACM
Restricting destructive update to values of a distinguished reference type prevents functions from being polymorphic in the mutability of their arguments. This restriction makes it...
133
click to vote
CIE
2005
Springer
15 years 11 months ago
2005
Springer
The strong weak truth table reducibility was suggested by Downey, Hirschfeldt, and LaForte as a measure of relative randomness, alternative to the Solovay reducibility. It also occ...
170
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We study the use of the elaboration preorder (due to ArunKumar and Natarajan) in the framework of up-to techniques for weak bisimulation. We show that elaboration yields ...