| H. Xi. On weak and strong normalisations. Technical Report 96-187, Carnegie Mellon University, 1996. A Proofs of the lemmas |
....[20] and [4] use whereas [16] uses to reduce the problem of strong normalization to the problem of weak normalization (WN) for related reductions. 14] uses and to reduce typability in the rank 2 restriction of the 2nd order calculus to the problem of acyclic semi uni cation. [18, 28, 26, 17] use related reductions to reduce SN to WN and [12] uses similar notions in SN proofs. 9] uses a more extended version of (called term reshu ing) and of g (called generalised reduction) where C and N are not only separated by the redex ( x : B but by many redexes (ordinary and generalised) ....
H. Xi. On weak and strong normalisations. Technical Report 96-187, Carnegie Mellon University, 1996. A Proofs of the lemmas
....with . 16] and [4] use whereas [12] uses to reduce the problem of strong normalization to the problem of weak normalization (WN) for related reductions. 10] uses and to reduce typability in the rank 2 restriction of the 2nd order calculus to the problem of acyclic semi uni cation. [14, 22, 20, 13] use related reductions to reduce SN to WN and [8] uses similar notions in SN proofs. 6] uses a more extended version of (called termreshu ing) and of g (called generalised reduction) where Q and N are not only separated by the redex ( x : P but by many redexes (ordinary and generalised) ....
H. Xi. On weak and strong normalisations. Technical Report 96-187, Carnegie Mellon University, 1996.
....thesis in [18] and [5] use whereas [14] uses to reduce the problem of strong normalization to the problem of weak normalization (WN) for related reductions. 12] uses and to reduce typability in the rank 2 restriction of the 2nd order calculus to the problem of acyclic semi uni cation. [16, 24, 22, 15] use related reductions to reduce SN to WN and [10] uses similar notions in SN proofs. 1] uses (called let C ) as a part of an analysis of how to implement sharing in a real language interpreter in a way that directly corresponds to a formal calculus. 8] uses a more extended version of ....
H. Xi. On weak and strong normalisations. Technical Report 96-187, Carnegie Mellon University, 1996.
....in [17] and [4] use whereas [13] uses fl to reduce the problem of fi strong normalization to the problem of weak normalization (WN) for related reductions. 11] uses and fl to reduce typability in the rank 2 restriction of the 2nd order calculus to the problem of acyclic semi unification. [15, 23, 21, 14] use related reductions to reduce SN to WN and [9] uses similar notions in SN proofs. 1] uses (called let C ) as a part of an analysis of how to implement sharing in a real language interpreter in a way that directly corresponds to a formal calculus. 6] uses a more extended version of ....
H. Xi. On weak and strong normalisations. Technical Report 96-187, Carnegie Mellon University, 1996.
....[ Delta] is a minor variant of Plotkin s call by name continuation passing style translation. S renson[29] then proved the equivalence between WN fi and SN fi in various typed calculi including the simply typed calculus, the simply typed calculus with positive recursive types, and . The author[32] showed the equivalence between WN fi and SN fi in and 2 with Church typing, and mentioned that [ Delta] can also be applied to . Delta] cannot be applied to terms in 2 with Curry typing since [M ] may not be a well typed 2 term for some M 2 2. Some explanation can be found in [13] and ....
H. Xi (1996), On weak and strong normalisations, Research Report 96-187, Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh.
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