Sciweavers

989 search results - page 52 / 198
» Pebbling and Proofs of Work
Sort
View
CADE
2005
Springer
14 years 8 months ago
Nominal Techniques in Isabelle/HOL
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...
Christian Urban, Christine Tasson
TAPSOFT
1987
Springer
13 years 11 months ago
Induction Principles Formalized in the Calculus of Constructions
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...
Gérard P. Huet
AAAI
2010
13 years 8 months ago
An Optimization Variant of Multi-Robot Path Planning Is Intractable
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 ...
Pavel Surynek
APAL
2008
95views more  APAL 2008»
13 years 8 months ago
The associated sheaf functor theorem in algebraic set theory
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...
Nicola Gambino
ENTCS
2010
113views more  ENTCS 2010»
13 years 8 months ago
Geometry of Synthesis II: From Games to Delay-Insensitive Circuits
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...
Dan R. Ghica, Alex Smith