Sciweavers

203 search results - page 24 / 41
» Proof Reflection in Coq
Sort
View
FUIN
2010
103views more  FUIN 2010»
13 years 5 months ago
Automation for Dependently Typed Functional Programming
Abstract. Writing dependently typed functional programs that capture non-trivial program properties, such as those involving membership, ordering and non-linear arithmetic, is diff...
Sean Wilson, Jacques D. Fleuriot, Alan Smaill
TPHOL
2006
IEEE
14 years 1 months ago
Otter/Ivy
Abstract. We compare the styles of several proof assistants for mathematics. We present Pythagoras’ proof of the irrationality of √ 2 both informal and formalized in (1) HOL, (...
Michael Beeson, William McCune
TYPES
2000
Springer
13 years 11 months ago
A Constructive Proof of the Fundamental Theorem of Algebra without Using the Rationals
Abstract. In the FTA project in Nijmegen we have formalized a constructive proof of the Fundamental Theorem of Algebra. In the formalization, we have first defined the (constructiv...
Herman Geuvers, Freek Wiedijk, Jan Zwanenburg
CSFW
2010
IEEE
13 years 11 months ago
A Machine-Checked Formalization of Sigma-Protocols
—Zero-knowledge proofs have a vast applicability in the domain of cryptography, stemming from the fact that they can be used to force potentially malicious parties to abide by th...
Gilles Barthe, Daniel Hedin, Santiago Zanella B&ea...
SAC
2006
ACM
13 years 7 months ago
Assisted verification of elementary functions using Gappa
The implementation of a correctly rounded or interval elementary function needs to be proven carefully in the very last details. The proof requires a tight bound on the overall er...
Florent de Dinechin, Christoph Quirin Lauter, Guil...