Higher-order rewrite systems and their confluence

Theoretical Computer Science

Volumn 192, Issue 1, 1998, Pages 3-29

  Mayr, Richard ^a   Nipkow, Tobias ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002569005     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00143-6     Document Type: Article

References (41)

1. P. Aczel, A general Church-Rosser theorem, Tech. Report, Univ. of Manchester, 1978.
2. F. Barbanera, M. Fernández, H. Geuvers, Modularity of strong normalization and confluence in the algebraic λ-cube, in: 9th IEEE Symp. Logic in Computer Science, IEEE Computer Society Press, Silver Spring, MD, 1994, pp. 406-415.
3. H.P. Barendregt, The Lambda Calculus, its Syntax and Semantics, 2nd ed., North-Holland, Amsterdam, 1984.
4. H.P. Barendregt, Lambda calculi with types, in: S. Abramsky, D.M. Gabbay, T.S.E. Maibaum (Eds.), Handbook of Logic in Computer Science, vol. 2, Oxford Univ. Press, Oxford, 1992, pp. 118-309.
5. N. Dershowitz, J.-P. Jouannaud, Rewrite systems, in: J. van Leeuwen (Ed.), Formal Models and Semantics, Handbook of Theoretical Computer Science, vol. B, Elsevier, Amsterdam, 1990, pp. 243-320.
6. D.J. Dougherty, Adding algebraic rewriting to the untyped lambda-calculus, in: R.V. Book (Ed.), Proc. 4th Int. Conf. Rewriting Techniques and Applications, Lecture Notes in Computer Science, vol. 488, Springer, Berlin, 1991, pp. 34-48.
7. J.H. Gallier, Logic for Computer Science. Harper & Row, New York, 1986.
8. W.D. Goldfarb, The undecidability of the second-order unification problem, Theoret. Comput. Sci. 13 (1981) 225-230.
9. M.J.C. Gordon, T.F. Melham, Introduction to HOL: A Theorem-Proving Environment for Higher Order Logic, Cambridge Univ. Press, Cambridge, 1993.
10. J.R. Hindley, J.P. Seldin, Introduction to Combinators and λ-Calculus, Cambridge Univ. Press, Cambridge, 1986.
11. G. Huet, Confluent reductions: abstract properties and applications to term rewriting systems, J. ACM, 27 (1980) 797-821.
12. G. Huet, J.-J. Lévy, Computations in orthogonal rewriting systems, in: J.-L. Lassez, G. Plotkin (Eds.), Computational Logic: Essays in Honor of Alan Robinson, MIT Press, Cambridge, MA, 1991, pp. 395-443.
13. J.-P. Jouannaud, A. Rubio, Higher-order simplification orderings, in: H. Comon (Ed.), Rewriting Techniques and Applications, Lecture Notes in Computer Science, Springer, Berlin, 1997.
14. S. Kahrs, Towards a domain theory for termination proofs, in: J. Hsiang (Ed.), Rewriting Techniques and Applications, Lecture Notes in Computer Science, vol. 914, Springer, Berlin, 1995, pp. 241-255.
15. S. Kahrs, The variable containment problem, in: G. Dowek, J. Heering, K. Meinke, B. Möller (Eds.), Higher-Order Algebra, Logic, and Term Rewriting, Lecture Notes in Computer Science, vol. 1074, Springer, Berlin, 1996, pp. 109-123.
16. J.W. Klop, Combinatory Reduction Systems, Mathematical Centre Tracts, vol. 127, Mathematisch Centrum, Amsterdam, 1980.
17. J.W. Klop, Term rewriting systems, in: S. Abramsky, D.M. Gabbay, T.S.E. Maibaum (Eds.), Handbook of Logic in Computer Science, vol. 2, Oxford Univ. Press, Oxford, 1992, pp. 2-116.
18. J.W. Klop, V. van Oostrom, F. van Raamsdonk, Combinatory reduction systems: introduction and survey, Theoret. Comput. Sci. 121 (1993) 279-308.
19. D.E. Knuth, P.B. Bendix, Simple word problems in universal algebra, in: J. Leech (Ed.), Computational Problems in Abstract Algebra, Pergamon Press, Oxford, 1970, pp. 263-297.
20. C.A. Loría-Sáenz, A theoretical framework for reasoning about program construction based on extensions of rewrite systems, Ph.D. Thesis, Universität Kaiserslautern, 1993.
21. O. Lysne, J. Piris, A termination ordering for higher-order rewrite systems, in: J. Hsiang (Ed.), Rewriting Techniques and Applications, Lecture Notes in Computer Science, Springer, Berlin, 1995, pp. 26-40.
22. R. Mayr, Konfluenz bei Termersetzungssystemen λ-Termen, Master's Thesis, Institut für Informatik, Technische Universität München, 1994.
23. D. Miller, A logic programming language with lambda-abstraction, function variables, and simple unification, J. Logic Comput. 1(4) (1991) 497-536.
24. F. Müller, Confluence of the lambda-calculus with left-linear algebraic rewriting, Inform. Process. Lett. 41 (1992) 293-299.
25. T. Nipkow, Higher-order critical pairs, in: 6th IEEE Symp. Logic in Computer Sci., IEEE Computer Soc. Press, Silver Spring, MD, 1991, pp. 342-349.
26. T. Nipkow, Functional unification of higher-order patterns, in: 8th IEEE Symp. Logic in Computer Science, IEEE Computer Soc. Press, Silver Spring, MD, 1993, pp. 64-74.
27. T. Nipkow, Orthogonal higher-order rewrite systems are confluent, in: M. Bezem, J.F. Groote (Eds.), Proc. Int. Conf. Typed Lambda Calculi and Applications, Lecture Notes in Computer Science, vol. 664, Springer, Berlin, 1993, pp. 306-317.
28. M.J. O'Donnell, Computing in Systems Described by Equations, Lecture Notes in Computer Science, vol. 58, Springer, Berlin, 1977.
29. V. van Oostrom, Confluence for abstract and higher-order rewriting, Ph.D. Thesis, Vrije Universiteit, Amsterdam, 1994.
30. V. van Oostrom, F. van Raamsdonk, Comparing combinatory reduction systems and higher-order rewrite systems, in: J. Heering, K. Meinke, B. Möller, T. Nipkow (Eds.), Higher-Order Algebra, Logic and Term Rewriting, Lecture Notes in Computer Science, vol. 816, Springer, Berlin, 1994, pp. 276-304.
31. V. van Oostrom, F. van Raamsdonk, Weak orthogonality implies confluence: the higher-order case, in: A. Nerode (Ed.), Logical Foundations of Computer Science, Lecture Notes in Computer Science, vol. 813, Springer, Berlin, 1994, pp. 379-392.
32. V. Padovani, On equivalence classes of interpolation equations, in: M. Dezani-Ciancaglini, G. Plotkin (Eds.), Typed Lambda Calculi and Applications, Lecture Notes in Computer Science, vol. 902, Springer, Berlin, 1995, pp. 335-349.
33. L.C. Paulson, Isabelle: A Generic Theorem Prover, Lecture Notes in Computer Science, vol. 828, Springer, Berlin, 1994.
34. J. van de Pol, Termination proofs for higher-order rewrite systems, in: J. Heering, K. Meinke, B. Möller, T. Nipkow (Eds.), Higher-Order Algebra, Logic and Term Rewriting, Lecture Notes in Computer Science, vol. 816, Springer, Berlin, 1994, pp. 305-325.
35. J. van de Pol, H. Schwichtenberg, Strict functionals for termination proofs, in: M. Dezani-Ciancaglini, G. Plotkin (Eds.), Typed Lambda Calculi and Applications, Lecture Notes in Computer Science, vol. 902, Springer, Berlin, 1995, pp. 350-364.
36. Z. Qian, Linear unification of higher-order patterns, in: M.-C. Gaudel, J.-P. Jouannaud (Eds.), Proc. Coll. Trees in Algebra and Programming, Lecture Notes in Computer Science, vol. 668, Springer, Berlin, 1993, pp. 391-405.
37. F. van Raamsdonk, Confluence and superdevelopments, in: C. Kirchner (Ed.), Rewriting Techniques and Applications, Lecture Notes in Computer Science, vol. 690, Springer, Berlin, 1993, pp. 168-182.
38. F. van Raamsdonk, Confluence and normalization for higher-order rewriting, Ph.D. Thesis, Vrije Universiteit, Amsterdam, 1996.
39. S. Stenlund, Combinators, λ-Terms, and Proof Theory, D. Reidel, Dordrecht, 1972.
40. M. Takahashi, λ-calculi with conditional rules, in: M. Bezem, J.F. Groote (Eds.), Typed Lambda Calculi and Applications, Lecture Notes in Computer Science, vol. 664, Springer, Berlin, 1993, pp. 406-417.
41. D.A. Wolfram, The Clausal Theory of Types, Cambridge Tracts in Theoretical Computer Science, vol. 21, Cambridge Univ. Press, Cambridge, 1993.