Download (1405Kb)

Literaturverzeichnis
[ADJ77] J. A. Goguen, J. W. Thatcher, E. G. Wagner, J. B. Wright: Initial Algebra Semantics
and Continuous Algebras; JACM, Vol. 24, No. 1, Januar 1977, S. 68 –
95.
[ADJ78] J. B. Wright, E. G. Wagner, J. W. Thatcher: A uniform approach to inductive
posets and inductive closure; Theoretical Computer Science 7, 1978, S. 57 – 77.
[An&Mid94] S. Antoy, A. Middeldorp: A Sequential Reduction Strategy; Proceedings of the 4th
International Conference on Algebraic and Logic Programming, Madrid, LNCS
850, September 1994, S. 168 – 185.
[de Bakker76] J. W. de Bakker: Least fixed points revisited; Theoretical Computer Science 2,
1976, S. 155 – 181.
[Bau&Otto84] G. Bauer, F. Otto: Finite Complete Rewriting Systems and the Complexity of the
Word Problem; Acta Informatica 21, 1984, S. 521 – 540.
[Ber&Klop86] J. A. Bergstra, J. W. Klop: Conditional Rewrite Rules: Confluence and Termination
; Journal of Computer and System Sciences 32, 1986, S. 323 – 362.
[Ber&Tu80] J. A. Bergstra, J. V. Tucker: A characterisation of computable data types by means
of a finite equational specification method; 7th Colloqium on Automata, Languages
and Programming, LNCS 85, 1980, S. 76 – 90.
[Ber&Lévy77] G. Berry, J.-J. Lévy: Minimal and Optimal Computations of Recursive Programs;
Fourth ACM Symposium on Principles of Programming Languages, 1977, S. 215
– 226.
[Berry78] G. Berry: Stable models of typed λ-calculi; Proceedings of the 5th ICALP Conference,
Udine, Italien, LNCS 62, 1978, S. 73 – 89.
[Ber&Cur82] G. Berry, P. L. Curien: Sequential Algorithms on Concrete Data Structures; Theoretical
Computer Science 20, 1982, S. 265 – 321.
[Broy&Wir82] M. Broy, M. Wirsing: Partial Abstract Types ; Acta Informatica 18, 1982, S. 47
– 64.
[Broy&Wir83] M. Broy, M. Wirsing: Generalized Heterogeneous Algebras and Partial Interpretations
; in: G. Ausiello; M. Protasi (ed.): Proc. 8th CAAP, LNCS 159, Springer,
1983, S. 1 –34.