Sciweavers

1581 search results - page 111 / 317
» Mechanizing Inductive Reasoning
Sort
View
FLOPS
2006
Springer
15 years 10 months ago
A Computational Approach to Pocklington Certificates in Type Theory
Pocklington certificates are known to provide short proofs of primality. We show how to perform this in the framework of formal, mechanically checked, proofs. We present an encodin...
Benjamin Grégoire, Laurent Théry, Be...
AISC
2010
Springer
15 years 4 months ago
Some Considerations on the Usability of Interactive Provers
In spite of the remarkable achievements recently obtained in the field of mechanization of formal reasoning, the overall usability of interactive provers does not seem to be sensib...
Andrea Asperti, Claudio Sacerdoti Coen
SOCIALCOM
2010
15 years 1 months ago
Incentive Compatible Distributed Data Mining
Abstract--In this paper, we propose a game-theoretic mechanism to encourage truthful data sharing for distributed data mining. Our proposed mechanism uses the classic VickreyClarke...
Murat Kantarcioglu, Robert Nix
TPHOL
2009
IEEE
16 years 29 days ago
Psi-calculi in Isabelle
Psi-calculi are extensions of the pi-calculus, accommodating arbitrary nominal datatypes to represent not only data but also communication channels, assertions and conditions, givi...
Jesper Bengtson, Joachim Parrow
TPHOL
2008
IEEE
16 years 21 days ago
A Type of Partial Recursive Functions
We describe a new method to represent (partial) recursive functions in type theory. For every recursive definition, we define a co-inductive type of prophecies that characterises...
Ana Bove, Venanzio Capretta