Sciweavers

1021 search results - page 22 / 205
» Concepts in Proof Planning
Sort
View
TYPES
1999
Springer
14 years 26 days ago
Information Retrieval in a Coq Proof Library Using Type Isomorphisms
We propose a method to search for a lemma in a goq proof library by using the lemma type as a key. The method is based on the concept of type isomorphism developed within the funct...
David Delahaye
ECCC
2006
88views more  ECCC 2006»
13 years 8 months ago
On Probabilistic versus Deterministic Provers in the Definition of Proofs Of Knowledge
Abstract. This article points out a gap between two natural formulations of the concept of a proof of knowledge, and shows that in all natural cases (e.g., NP-statements) this gap ...
Mihir Bellare, Oded Goldreich
CRYPTO
2005
Springer
103views Cryptology» more  CRYPTO 2005»
14 years 2 months ago
Pebbling and Proofs of Work
We investigate methods for providing easy-to-check proofs of computational effort. Originally intended for discouraging spam, the concept has wide applicability as a method for co...
Cynthia Dwork, Moni Naor, Hoeteck Wee
IFL
2005
Springer
116views Formal Methods» more  IFL 2005»
14 years 2 months ago
Proof Tool Support for Explicit Strictness
In programs written in lazy functional languages such as for example Clean and Haskell, the programmer can choose freely whether particular subexpressions will be evaluated lazily ...
Marko C. J. D. van Eekelen, Maarten de Mol
SAC
2010
ACM
13 years 3 months ago
Similar triangles and orientation in plane elementary geometry for Coq-based proofs
In plane elementary geometry, the concept of similar triangles not only forms an important foundation for trigonometry, but it also can be used to solve many geometric problems. T...
Tuan Minh Pham