63 search results - page 2 / 13 » Short proofs of strong normalization |
TLCA
1993
Springer
14 years 2 months ago
1993
Springer
ENTCS
2007
13 years 10 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...
TCS
2010
13 years 9 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...
TCS
2008
13 years 10 months ago
2008
We introduce a new unification procedure for the type inference problem in the intersection type discipline. It is well known that type inference in this case should succeed exact...
LPAR
2010
Springer
13 years 9 months ago
2010
Springer
Termination of recursive functions is an important property in proof assistants based on dependent type theories; it implies consistency and decidability of type checking. Type-bas...