989 search results - page 52 / 198 » Pebbling and Proofs of Work |
113
click to vote
CADE
2005
Springer
16 years 2 months ago
2005
Springer
Abstract This paper describes a formalisation of the lambda-calculus in a HOL-based theorem prover using nominal techniques. Central to the formalisation is an inductive set that i...
TAPSOFT
1987
Springer
15 years 5 months ago
1987
Springer
The Calculus of Constructions is a higher-order formalism for writing constructive proofs in a natural deduction style, inspired from work of de Bruijn [2, 3], Girard [12], Martin...
110
click to vote
AAAI
2010
15 years 2 months ago
2010
An optimization variant of a problem of path planning for multiple robots is addressed in this work. The task is to find spatial-temporal path for each robot of a group of robots ...
APAL
2008
15 years 2 months ago
2008
Abstract. We prove a version of the associated sheaf functor theorem in Algebraic Set Theory. The proof is established working within a Heyting pretopos equipped with a system of s...
120
click to vote
ENTCS
2010
15 years 2 months ago
2010
This paper extends previous work on the compilation of higher-order imperative languages into digital circuits [4]. We introduce concurrency, an essential feature in the context o...