6 search results - page 1 / 2 » Minlog |
TPHOL
2006
IEEE
14 years 1 months ago
2006
IEEE
We extract on the computer a number of moduli of uniform continuity for the first few elements of a sequence of closed terms t of G¨odel’s T of type (N→N)→(N→N). The gen...
LCC
1994
13 years 11 months ago
1994
We demonstrate program extraction by the Light Dialectica Interpretation (LDI) on a minimal logic proof of the classical existence of Fibonacci numbers. This semi-classical proof ...
TLCA
1993
Springer
13 years 11 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...
CIE
2006
Springer
13 years 10 months ago
2006
Springer
We describe two representations for real numbers, signed digit streams and Cauchy sequences. We give coinductive proofs for the correctness of functions converting between these tw...
TPHOL
2006
IEEE
14 years 1 months ago
2006
IEEE
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, (...