6 search results - page 1 / 2 » Modified Realizability Toposes and Strong Normalization Proo... |
65
Voted
TLCA
1993
Springer
15 years 2 months ago
1993
Springer
61
Voted
TYPES
1993
Springer
15 years 2 months ago
1993
Springer
ENTCS
2006
14 years 10 months ago
2006
We formalize two proofs of weak head normalization for the simply typed lambdacalculus in first-order minimal logic: one for normal-order reduction, and one for applicative-order ...
85
Voted
CADE
2006
Springer
15 years 10 months ago
2006
Springer
Church's Higher Order Logic is a basis for proof assistants -- HOL and PVS. Church's logic has a simple set-theoretic semantics, making it trustworthy and extensible. We ...
78
Voted
LICS
2007
IEEE
15 years 4 months ago
2007
IEEE
Set theories are traditionally based on first-order logic. We show that in a constructive setting, basing a set theory on a dependent logic yields many benefits. To this end, we...