989 search results - page 44 / 198 » Pebbling and Proofs of Work |
APAL
2005
13 years 8 months ago
2005
We present an extension of Heyting Arithmetic in finite types called Uniform Heyting Arithmetic (HAu) that allows for the extraction of optimized programs from constructive and cla...
TCS
2008
13 years 8 months ago
2008
The purpose of this paper is to decipher constructively a lemma of Suslin which played a central role in his second solution of Serre's problem on projective modules over pol...
LICS
2010
IEEE
13 years 6 months ago
2010
IEEE
This work belongs to a wider effort aimed at eliminating syntactic bureaucracy from proof systems. In this paper, we present a novel cut elimination procedure for classical propos...
TPHOL
2000
IEEE
14 years 20 days ago
2000
IEEE
We verify within the Coq proof assistant that ML typing is sound with respect to the dynamic semantics. We prove this property in the framework of a big step semantics and also in ...
FOSSACS
2004
Springer
14 years 8 hour ago
2004
Springer
In this paper we present a theorem for defining fixed-points in categories of sheaves. This result gives a unifying and general account of most techniques used in computer science ...