The Longest Perpetual Reductions in Orthogonal Expression Reduction Systems (1994)

Cached

Download Links

by Zurab Khasidashvili
Venue:In: Proc. of the 3 rd International Conference on Logical Foundations of Computer Science, LFCS'94, A. Nerode and Yu.V. Matiyasevich, eds., Springer LNCS
Citations:18 - 8 self

Documents Related by Co-Citation

249 Combinatory Reduction Systems – J W Klop - 1980
520 Lambda Calculi with Types – Henk Barendregt, S. Abramsky, D. M. Gabbay, T. S. E. Maibaum, H. P. Barendregt - 1992
567 Term Rewriting Systems – J. W. Klop - 1992
32 The Conservation Theorem revisited – Philippe de Groote - 1993
1125 The Lambda Calculus: Its Syntax and Semantics – H P Barendregt - 1981
77 Confluence for Abstract and Higher-Order Rewriting – V van Oostrom - 1994
70 Some Properties of Conversion – Alonzo Church, J Barkley Rosser - 1936
54 Strong normalization in a typed lambda calculus with lambda structured types – R P Nederpelt - 1994
35 Une équivalence sur les lambda-termes – L Regnier - 1994
18 Addendum to `New notions of reduction and non-semantic proofs of β-strong normalization in typed λ-calculi – A. J. Kfoury, J. B. Wells - 1995
38 Orthogonal higher-order rewrite systems are confluent – T Nipkow - 1993
31 Description Abstraite des Systèmes de Réécriture – P-A Melliès - 1996
20 A useful -notation – F Kamareddine, R P Nederpelt - 1996
9 On weak and strong normalisations – H Xi - 1996
10 Perpetuality and Strong Normalization in Orthogonal Term Rewriting Systems – Zurab Khasidashvili - 1994
20 The Clausal Theory of Types, Cambridge Tracts – D A Wolfram - 1993
22 The Church-Rosser theorem in orthogonal combinatory reduction systems. Rapports de Recherche 1825, INRIA-Rocquencourt – Zurab Khasidashvili - 1992
23 Weak orthogonality implies confluence: the higher-order case – V van Oostrom, F van Raamsdonk - 1994
20 On Higher Order Recursive Program Schemes – Zurab Khasidashvili