Confluence of curried term-rewriting systems

Journal of Symbolic Computation

Volumn 19, Issue 6, 1995, Pages 601-623

  Kahrs, Stefan ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0011569884     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.1995.1035     Document Type: Article

References (21)

1. Brainerd, W.S. (1969). Tree generating regular systems. Information and Control 14, 217-231.
2. Breazu-Tannen V., Gallier, J. (1989). Polymorphic rewriting conserves algebraic strong normalization and confluence. In Proceedings 16tk nternationa/Colloquium on Automata, Languages and Programming. Springer LNCS 372, 137-150.
3. Gallier, J. (1994). On the correspondence between proofs and A-terms. In de Groote, P., editor, The Curry-Howard Isomorphism, Cahiers du Centre de Logique. Université Catholique de Louvain, 1994. To appear.
4. Girard, J.-Y., Lafont, Y., Taylor, P. (1989). Proofs and Types. Cambridge University Press.
5. Grämlich, B. (1992). Relating innermost, weak, uniform and modular termination of rewriting. In Proceedings Logic Programming and Automated Reasoning, Springer LNCS 624, 285-296.
6. Hindley, J.R. (1969). An Abstract Form of the Church-Rosser Theorem I. Journal of Symbolic Logic 34, 545-560.
7. Hindley, J.R., Seldin, J.P. (1986). Introduction to Combinators and A -Calculus. Cambridge University Press.
8. Huet, G. (1980). Confluent reductions: abstract properties and applications to term rewriting systems. Journal of the ACM 27, 797-821.
9. Kahrs, S. (1991). A-rewriting. PhD thesis, Universität Bremen. In German.
10. Kennaway, J.R., Klop, J.W., Sleep, M.R., de Vries, F.-J. (1993). Comparing curried and uncurried rewriting. Technical Report CS-R9350, Centrum voor Wiskunde en Informatica.
11. Kennaway, J.R., Klop, J.W., Sleep, M.R., de Vries, F.-J. (1995). Comparing curried and uncurried rewriting. To appear in: Journal of Symbolic Computation.
12. Klop, J.W. (1992). Term rewriting systems. In Abramsky, S., Gabbai, D.M., Maibaum, T.S.E., editors, Handbook of Logic in Computer Science, volume 2, 1-116. Oxford University Press.
13. Klop, J.W., Middeldorp, A., Toyama, Y., de Vrijer, R. (1991). A simplified proof of Toyama’s theorem. Technical Report CS-R9156, Centrum voor Wiskunde en Informatica.
14. Lloyd, J.W. (1984). Foundations of Logic Programming. Springer.
15. Meinke, K., Tucker, J.V. (1992). Universal algebra. In Abramsky, S., Gabbay, D.M., Maibaum, T.S.E., editors, Handbook of Logic in Computer Science, Volume 1, 189-411. Oxford University Press.
16. Nipkow, T. (1991). Higher order critical pairs. In Proceedings of the IEEE Symposium on Logic in Computer Science, 342—349.
17. van Oostrom, V., van Raamsdonk, F. (1993). Comparing combinatory reduction systems and higher-order rewrite systems. In Proceedings Higher-Order Algebra, Logic and Term Rewriting. Springer LNCS 816, 276-304.
18. Plump, D. (1993). Evaluation of Functional Expressions by Hypergraph Rewriting. PhD thesis, Universität Bremen.
19. Rosen, B.K. (1973). Tree-manipulating systems and Church-Rosser theorems. Journal of the ACM 20, 160-187.
20. Staples, J. (1975). Church-Rosser theories for replacement systems. In Crossley, J.N., editor, Algebra and Logic, 291-307. Springer LNM 450.
21. Toyama, Y. (1987). On the Chuch-Rosser property for the direct sum of term rewriting systems. Journal of the ACM 34, 128-143.