46 search results - page 8 / 10 » Strong normalization proofs by CPS-translations |
TAPSOFT
1997
Springer
13 years 11 months ago
1997
Springer
The SML-like module systems are small typed languages of their own. As is, one would expect a proof of their soundness following from a proof of subject reduction. Unfortunately, t...
CSL
2005
Springer
14 years 1 months ago
2005
Springer
Since Val Tannen's pioneering work on the combination of simply-typed λ-calculus and rst-order rewriting [11], many authors have contributed to this subject by extending it ...
ICIC
2007
Springer
14 years 1 months ago
2007
Springer
Whether constant π (i.e., pi) is normal is a confusing problem without any strict theoretical demonstration except for some statistical proof. A new concept of pi series is introd...
TCS
2011
13 years 2 months ago
2011
Fuzzy cellular automata (FCA) are continuous cellular automata where the local rule is defined as the “fuzzification" of the local rule of a corresponding Boolean cellula...
LICS
2007
IEEE
14 years 1 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...