3552 search results - page 52 / 711 » Proof theory in the abstract |
CSL
2003
Springer
15 years 7 months ago
2003
Springer
We propose a method for realising the proofs of Intuitionistic Zermelo-Fraenkel set theory (IZF) by strongly normalising λ-terms. This
117
click to vote
CIE
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. A classic result known as the speed-up theorem in machineindependent complexity theory shows that there exist some computable functions that do not have best programs for...
122
click to vote
GECCO
2010
Springer
15 years 5 months ago
2010
Springer
The Baldwin Effect is a very plausible, but unproven, biological theory concerning the power of learning to accelerate evolution. Simple computational models in the 1980’s gave...
143
click to vote
HASKELL
2005
ACM
15 years 7 months ago
2005
ACM
Proof assistants based on dependent type theory are closely related to functional programming languages, and so it is tempting to use them to prove the correctness of functional p...
BIRTHDAY
2005
Springer
15 years 7 months ago
2005
Springer
Schematic proofs are functions which can produce a proof of a proposition for each value of their parameters. A schematic proof can be constructed by abstracting a general pattern ...