Perpetuality and Strong Normalization in Orthogonal Term Rewriting Systems
暂无分享,去创建一个
[1] Zurab Khasidashvili. Optimal Normalization in Orthogonal Term Rewriting Systems , 1993, RTA.
[2] Jean-Pierre Jouannaud,et al. Rewrite Systems , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.
[3] Robert Pieter Nederpelt Lazarom. Strong normalization in a typed lambda calculus with lambda structured types , 1973 .
[4] Zurab Khasidashvili. Perpetual reductions and strong normalization in orthogonal term rewriting systems , 1993 .
[5] Zurab Khasidashvili. On the equivalence of persistent term rewriting systems and recursive program schemes , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.
[6] F. vanRaamsdonk. A simple proof of confluence for weakly orthogonal combinatory reduction systems , 1992 .
[7] Michael J. O'Donnell,et al. Computing in systems described by equations , 1977, Lecture Notes in Computer Science.
[8] Jan A. Bergstra,et al. Degrees, reductions and representability in the lambda calculus , 1976 .
[9] Jean-Jacques Lévy,et al. Computations in Orthogonal Rewriting Systems, II , 1991, Computational Logic - Essays in Honor of Alan Robinson.
[10] Zurab Khasidashvili. Perpetual reductions in orthogonal combinatory reduction systems , 1993 .
[11] Bruno Courcelle,et al. Recursive Applicative Program Schemes , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.
[12] Femke Raamsdonk. A simple proof of confluence for weakly orthogonal combinatory reduction systems , 1992 .
[13] Jan Willem Klop,et al. Combinatory reduction systems , 1980 .