305 search results - page 1 / 61 » From Sets to Bits in Coq |
ENTCS
2006
13 years 4 months ago
2006
We describe an automatic complexity analysis mechanism for programs extracted from proofs carried out with the proof assistant Coq. By extraction, we mean the automatic generation...
TYPES
2000
Springer
13 years 8 months ago
2000
Springer
We describe a construction of the real numbers carried out in the Coq proof assistant. The basis is a set of axioms for the constructive real numbers as used in the FTA (Fundamenta...
JSC
2002
13 years 4 months ago
2002
We describe a framework of algebraic structures in the proof assistant Coq. We have developed this framework as part of the FTA project in Nijmegen, in which a constructive proof ...
TLCA
1993
Springer
13 years 9 months ago
1993
Springer
This paper describes formalizations of Tait’s normalization proof for the simply typed λ-calculus in the proof assistants Minlog, Coq and Isabelle/HOL. From the formal proofs p...
VLSISP
2008
13 years 4 months ago
2008
Advanced bit manipulation operations are not efficiently supported by commodity word-oriented microprocessors. Programming tricks are typically devised to shorten the long sequence...