46 search results - page 5 / 10 » Strong normalization proofs by CPS-translations |
CORR
2006
Springer
13 years 7 months ago
2006
Springer
We use entropy rates and Schur concavity to prove that, for every integer k 2, every nonzero rational number q, and every real number , the base-k expansions of , q + , and q all...
LACL
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. We investigate natural deduction proofs of the Lambek calculus from the point of view of tree automata. The main result is that the set of proofs of the Lambek calculus c...
AML
2007
13 years 7 months ago
2007
A method is described for obtaining conjunctive normal forms for logics using Gentzen-style rules possessing a special kind of strong invertibility. This method is then applied to ...
ENTCS
2002
13 years 7 months ago
2002
This paper presents a step in the development of an operational approach to program extraction in type theory. In order to get a program from a lambda term, the logical parts need...
AFRICACRYPT
2010
Springer
14 years 21 days ago
2010
Springer
the full version of the extended abstract which appears in Africacrypt ’10 (3 – 6 may 2010, Stellenbosch, South Africa) D. Bernstein and T. Lange Eds., Springer-Verlag, LNCS 60...