46 search results - page 2 / 10 » Strong normalization proofs by CPS-translations |
TLCA
1993
Springer
15 years 3 months ago
1993
Springer
TLCA
1993
Springer
15 years 3 months ago
1993
Springer
JSYML
2011
14 years 6 months ago
2011
Abstract. Westudy cut-elimination in first-orderclassical logic. Weconstructa sequenceofpolynomiallength proofs having a non-elementary number of different cut-free normal forms....
ENTCS
2007
14 years 11 months ago
2007
We formalize in the logical framework ATS/LF a proof based on Tait’s method that establishes the simply-typed lambda-calculus being strongly normalizing. In malization, we emplo...
106
click to vote
TCS
2010
14 years 10 months ago
2010
The paper contains the first complete proof of strong normalization (SN) for full second order linear logic (LL): Girard’s original proof uses a standardization theorem which i...