Download (1405Kb)

184 LITERATURVERZEICHNIS
[KNO90] D. Kapur, P. Narendran, F. Otto: On Ground-Confluence of Term Rewriting
Systems ; Information and Computation 86, 1990, S. 14 –31.
[KNZ87] D. Kapur, P. Narendran, H. Zhang: On Sufficient-Completeness and Related Properties
of Term Rewriting Systems ; Acta Informatica 24, 1987, S. 395 – 415.
[Kes92] D. Kesner: Free Sequentiality in Orthogonal Order-Sorted Rewriting Systems with
Constructors ; Proceedings of the 11th International Conference on Automated
Deduction, Saratoga Springs, New York, LNCS 607, 1992, S. 603 – 617.
[Klop87] J. W. Klop: Term Rewriting Systems: A Tutorial; EATCS Bulletin 32, Juni 1987,
S. 143 – 182.
[Klop&Midd91] J. W. Klop, A. Middeldorp: Sequentiality in Orthogonal Term Rewriting Systems ;
Journal of Symbolic Computation, Vol. 2, 1991, S. 161 – 195.
[Lav87] A. Laville: Lazy pattern matching in the ML language ; Proc. 7th Conf. on Foundations
of Software Technology and Theoretical Computer Science, LNCS 287,
Springer, 1987, S. 400 – 419.
[Loe&Sie87] J. Loeckx, K. Sieber: The Foundations of Program Verification, Part B; Wiley –
Teubner, 1987.
[Manna74] Z. Manna: Mathematical Theory of Computation, Chapter 5; McGraw Hill, 1974.
[Mar76] G. Markowsky: Chain-complete posets and directed sets with applications ; Algebra
Universalis 6, 1976, S. 53 – 68.
[Meyer90] B. Meyer: Introduction to the Theory of Programming Languages; Prentice Hall,
1990.
[MirMan89] Miranda, Release 2, System Manual; Research Software Ltd., 1989.
[Naoi&Ina89] T. Naoi, Y. Inagaki: Algebraic Semantics and Complexity of Term Rewriting Systems
; 3rd International Conference on Rewriting Techniques and Applications,
LNCS 355, 1989, S. 311 – 325.
[Nivat75] M. Nivat: On the interpretation of recursive polyadic program schemes; Symposia
Mathematica 15 – Convegni del Febbraio e dell’ Aprile del 1973, Rom, 1975,
S. 255 – 281.
[Noll95] T. Noll: Why Higher-Order Functions and Lazy Evaluation do not Matter ; wird
eingereicht für: Functional Programming Languages and Computer Architecture
1995.
[O’Do77] M. J. O’Donnell: Computing in Systems Described by Equations; LNCS 58, Springer,
1977.
[Qya87] M. Oyamaguchi: The Church-Rosser property for ground term rewriting systems
is decidable; Theoret. Comput. Sci., Vol. 49, Nr. 1, 1987, S. 43 – 79.
[Ra&Vui80] J.-C. Raoult, J. Vuillemin: Operational and Semantic Equivalence Between Recursive
Programs; JACM, Vol. 27, No. 4, Oktober 1980, S. 772 – 796.