Download (1405Kb)

182 LITERATURVERZEICHNIS
[Bur86] P. Burmeister: A Model Theoretic Oriented Approach to Partial Algebras ; Mathematical
Research, Vol. 32, Akademie-Verlag, Berlin, 1986.
[BMS80] R. M. Burstall, D. B. MacQueen, D. T. Sannella: Hope: An experimental applicative
language; ACM Conference on Lisp and Functional Programming, Stanford,
1980, S. 136 – 143
[Bur&Cam93] F. W. Burton, R. D. Cameron: Pattern Matching with Abstract Data Types ; Journal
of Functional Programming 3 (2), 1993, S. 171 – 190.
[Ca&Fell92] R. Cartwright, M. Felleisen: Observable Sequentiality and Full Abstraction ; Conference
Record of the 19th Annual ACM Symposium on Principles of Programming
Languages, POPL, 1992, S. 328 – 342.
[Chen&O’Do91] Y. Chen, M.J. O’Donnell: Infinite Terms and Infinite Rewritings; Conditional
and typed rewriting systems – 2nd International CTRS workshop, Montreal,
Canada, Juni 1990, LNCS 516, 1991, S. 115 – 126.
[Com91] H. Comon: Disunification: A Survey; J.-L. Lassez, G. Plotkin (ed.): Computational
Logic – Essays in Honor of Alan Robinson, MIT Press, 1991, S. 322 –
359.
[Cou80] B. Courcelle: Completions of ordered magmas; Fundamenta Informaticae III.1,
1980, S. 105 – 116.
[Cou83] B. Courcelle: Fundamental Properties of Infinite Trees; Theoretical Computer
Science 25, 1983, S. 95 – 169.
[Cou90] B. Courcelle: Recursive Applicative Program Schemes; in: J. van Leeuwen (ed.):
Handbook of Theoretical Computer Science, Vol. B: Formal Models and Semantics,
Elsevier, Amsterdam 1990, S. 459 – 492.
[Dau89] M. Dauchet: Simulation of Turing machines by a left-linear rewrite rule; Proc.
3rd RTA, Springer Verlag, LNCS 355, 1989, S. 109 – 120.
[DHLT90] M. Dauchet, T. Heuillar, P. Lescanne, S. Tison: Decidability of the confluence of
finite ground term rewriting systems and of other related term rewrite systems ;
Information and Computation, Vol. 88, Nr. 2, 1990, S. 187 – 201
[Der87] N. Dershowitz: Termination of Rewriting; Journal on Symbolic Computation 3
(1&2), 1987, S. 69 – 115, Corrigendum: 4, 1987, S. 409 – 410.
[Der&Jou90] N. Dershowitz, J.-P. Jouannaud: Rewrite Systems ; in: J. van Leeuwen (ed.):
Handbook of Theoretical Computer Science, Vol. B: Formal Models and Semantics,
Elsevier, Amsterdam 1990, S. 243 – 320.
[DKP91] N. Dershowitz, St. Kaplan, D. A. Plaisted: Rewrite, rewrite, rewrite, rewrite,
rewrite, . . . ; Theoretical Computer Science 83, 1991, S. 71 – 96.
[DMK92] N. Dershowitz, S. Mitra, G. Sivakumar: Decidable Matching for Convergent Systems
; CADE–11: 11th international conference on automated deduction, LNCS
607, S. 589 – 602.