| J.-L. Krivine. A general storage theorem for integers in call-by-name #-calculus. Theor. Comp. Sc. 129, p. 79-94 (1994). |
....that if is the empty type then so is : 0 . Note that, as we announced, our restriction on : 0 types is satisfied by this translation. It is straightforward to check that the type translation rules are compatible with the term ones. 4.4. Krivine s translation Krivine s translation [12, 13] is essentially a slight amelioration of the former Godel s translation of classical into intuitionistic logic; contrarily to Plotkin s one it is type dependent. A CLC type A is associated to a lambda mu type A by the following rules: X B The two kinds of typing judgments in ....
J.-L. Krivine. A general storage theorem for integers in call-by-name -calculus. Theoretical Computer Science, 129:79--94, 1994.
....to functions of any arity. See how natural the formulation of the theorem is, 0 being, just by virtue of its concluding sequent, a correct converter, converting classical integers to linear integers. The reader should compare this to the LJ based approaches to this same conversion problem in [22, 23, 31]. Another possibility would be the use of a calculus enabling the fusion of intuitionistic and classical reasoning (cf. 12] as in [26] Quite surprisingly we even get a stronger result. Suppose one adds to classical logic the juxtaposition rule, then the same analysis shows that 0 will now ....
Krivine, J.L.(1994b) A general storage theorem for integers in call-by-name -calculus. Theoretical Computer Science, 129:79--94.
No context found.
J.-L. Krivine. A general storage theorem for integers in call-by-name #-calculus. Theor. Comp. Sc. 129, p. 79-94 (1994).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC