989 search results - page 39 / 198 » Pebbling and Proofs of Work |
TLCA
2001
Springer
14 years 22 days ago
2001
Springer
In this paper we introduce a cut-elimination procedure for classical logic, which is both strongly normalising and consisting of local proof transformations. Traditional cut-elimin...
VSTTE
2010
Springer
13 years 6 months ago
2010
Springer
Garbage collectors are very hard to implement correctly due to their low-level manipulation of memory. In this paper, we construct a copying garbage collector which we have proved ...
CSL
2005
Springer
14 years 1 months ago
2005
Springer
Recent work establishes a direct link between the complexity of a linear logic proof in terms of the exchange rule and the topological complexity of its corresponding proof net, ex...
ENTCS
2008
13 years 8 months ago
2008
Deep inference is a proof theoretical methodology that generalizes the traditional notion of inference in the sequent calculus: in contrast to the sequent calculus, the deductive ...
VAMOS
2007
Springer
14 years 2 months ago
2007
Springer
A short theatrical exaggeration (but not too much) which describes practical problems with variability as experienced by real-world software developers. Real issue, there are no p...