Download (1405Kb)

LITERATURVERZEICHNIS 185
[Ros73] B. K. Rosen: Tree-Manipulating Systems and Church-Rosser Theorems; JACM,
Vol. 20, 1973, S. 160 – 187.
[Shoen77] J. R. Shoenfield: Axioms of Set Theory; J. Barwise (ed.): Handbook of Mathematical
Logic (Part B), Amsterdam, North-Holland, 1977, S. 321 – 344.
[Tha87] S. Thatte: A Refinement of Strong Sequentiality for Term Rewriting Systems with
Constructors ; Information and Computation 72, 1987, S. 46 – 65.
[Thiel84] J. J. Thiel: Stop losing sleep over incomplete data type specifications; Proceedings
of the 11th Annual ACM Symposium on Principles of Programming Languages,
Salt Lake City, Utah, 1984, S. 76 – 82.
[Tho86] S. J. Thompson: Laws in Miranda; Conference Record of the 1986 Conference on
LISP and Functional Programming, 1986, S. 1 – 12.
[Tho89] S. J. Thompson: A Logic for Miranda; Formal Aspects of Computing 1, 1989,
S. 339 – 365.
[Tho90] S. J. Thompson: Lawful functions and program verification in Miranda; Science
of Computer Programming 13 (2-3), Mai 1990, S. 181 – 218.
[Tho94] S. J. Thompson: A Logic for Miranda, Revisited; Technical Report No. 1-94,
University of Kent at Canterbury, 1994.
[Vui74] J. Vuillemin: Correct and Optimal Implementations of Recursion in a Simple Programming
Language; Journal of Computer and System Sciences 9, 1974, S. 332
– 354.
[Vui74b] J. Vuillemin: Syntax, sémantique et axiomatique d’un langage de programmation
simple ; Thèse, Université Paris VI, 1974.
[We92] W. Wechler: Universal Algebra for Computer Scientists; Springer-Verlag, 1992.
[Wir90] M. Wirsing: Algebraic Specification; in: J. van Leeuwen (ed.): Handbook of Theoretical
Computer Science, Vol. B: Formal Models and Semantics, Elsevier, Amsterdam
1990, S. 675 – 788.