de Groote, P., The conservation theorem revisited, Int'l Conf. Typed Lambda Calculi and Applications, vol. 664 of LNCS, 163-178, Springer-Verlag, 1993. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A reduction relation for which postponement of.. - Fairouz Kamareddine.. (1996) (3 citations) (Correct)
....Strongly Normalising (SN) Vid 89] also introduces reductions similar to those of [Reg 94] Furthermore, KTU 94] uses (and other reductions) to show that typability in ML is equivalent to acyclic semi unification. SF 92] uses a reduction which has some common themes to . Nederpelt 73] and [dG 93] use whereas [KW 95a] uses fl to reduce the problem of strong normalisation for fi reduction to the problem of weak normalisation for related reductions. KW 94] uses amongst other things, and fl to reduce typability in the rank 2 restriction of system F to the problem of acyclic ....
....fi I N and it is impossible to fi I reduce ( y : x :x) MN . Moreover, x : y :y( z :zz) u) z :zz is fi I normalising but not strongly fi normalising. Attempts have been made at establishing some reduction relations for which postponement of K contractions and conservation hold ( Bar 84] and [dG 93] The picture is as follows ( N stands for normalising and r 2 ffi I ; K g) fi I K P fi K O (Conservation for fi I ) If M is fi I N then M is fi I SN (Conservation for fi ) If M is fi I K N then M is fi SN Conservation for fi I is found in [Bar 84] Conservation for fi ....
[Article contains additional citation context not shown here]
de Groote, P., The conservation theorem revisited, Int'l Conf. Typed Lambda Calculi and Applications, vol. 664 of LNCS, 163-178, Springer-Verlag, 1993.
The Lambda-Cube With Classes Which Approximate.. - Bloo, Kamareddine.. (1995) (Correct)
....longest reduction path when the term is SN. Vid 89] also introduces reductions similar to those of [Reg 94] Furthermore, KTU 94] uses (and other reductions) to show that typability in ML is equivalent to acyclic semi unification. SF 92] uses a reduction which has some common themes to . dG 93] uses a restricted version of and [KW 95a] uses fl to reduce the problem of strong normalisation for fi reduction to the problem of weak normalisation for related reductions. KW 94] uses amongst other things, and fl to reduce typability in the rank 2 restriction of system F to the problem of ....
de Groote, P., The conservation theorem revisited, Int'l Conf. Typed Lambda Calculi and Applications, vol. 664 of LNCS, 163-178, Springer-Verlag, 1993.
A reduction relation for which postponement of K-contractions.. - Kamareddine (1996) (3 citations) (Correct)
....Strongly Normalising (SN) Vid 89] also introduces reductions similar to those of [Reg 94] Furthermore, KTU 94] uses (and other reductions) to show that typability in ML is equivalent to acyclic semi unification. SF 92] uses a reduction which has some common themes to . Nederpelt 73] and [dG 93] use whereas [KW 95a] uses fl to reduce the problem of strong normalisation for fi reduction to the problem of weak normalisation for related reductions. KW 94] uses amongst other things, and fl to reduce typability in the rank 2 restriction of system F to the problem of acyclic ....
....fi I N and it is impossible to fi I reduce ( y : x :x) MN . Moreover, x : y :y( z :zz) u) z :zz is fi I normalising but not strongly fi normalising. Attempts have been made at establishing some reduction relations for which postponement of K contractions and conservation hold ( Bar 84] and [dG 93] The picture is as follows ( N stands for normalising and r 2 ffi I ; K g) fi K postponement for r) If M fi K N r O then 9P such that M fi I K P fi K O (Conservation for fi I ) If M is fi I N then M is fi I SN (Conservation for fi ) If M is fi I K N then M is ....
[Article contains additional citation context not shown here]
de Groote, P., The conservation theorem revisited, Int'l Conf. Typed Lambda Calculi and Applications, vol. 664 of LNCS, 163-178, Springer-Verlag, 1993.
The Lambda-Cube With Classes Which Approximate.. - Bloo, Kamareddine.. (1995) (Correct)
....longest reduction path when the term is SN. Vid 89] also introduces reductions similar to those of [Reg 94] Furthermore, KTU 94] uses (and other reductions) to show that typability in ML is equivalent to acyclic semi unification. SF 92] uses a reduction which has some common themes to . dG 93] uses a restricted version of and [KW 95a] uses fl to reduce the problem of strong normalisation for fi reduction to the problem of weak normalisation for related reductions. KW 94] uses amongst other things, and fl to reduce typability in the rank 2 restriction of system F to the problem ....
de Groote, P., The conservation theorem revisited, Int'l Conf. Typed Lambda Calculi and Applications, vol. 664 of LNCS, 163-178, Springer-Verlag, 1993.
Models of Lambda Calculi and Linear Logic: Structural, Equational .. - Loader (1994) (8 citations) (Correct)
No context found.
M. Bezem and J. Groote, editors, Typed Lambda Calculi and Applications, proceedings of the conference in Utrecht, 1993. Lecture Notes in Computer Science, volume 664. Springer-Verlag, 1993.
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