Higher-order rewriting

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1631, Issue , 1999, Pages 220-239

  van Raamsdonk, Femke ^a,b  

^a VU UNIVERSITY AMSTERDAM   (Netherlands)

^b NONE   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 56349157255     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48685-2_17     Document Type: Conference Paper

References (37)

1. P. Aczel. A general Church-Rosser theorem. University of Manchester, July 1978.
2. A. Asperti and C. Laneve. Interaction systems I: The theory of optimal reductions. Mathematical Structures in Computer Science, 4:457-504, 1994.
3. H.P. Barendregt. The Lambda Calculus, its Syntax and Semantics, volume 103 of Studies in Logic and the Foundations of Mathematics. North-Holland Publishing Company, revised edition, 1984.
4. J.A. Bergstra and J.W. Klop. Conditional rewrite rules: Confluence and termination. Journal of Computer and System Sciences, 32:323-362, 1986.
5. Alonzo Church and J.B. Rosser. Some properties of conversion. Transactions of the Americal Mathematical Society, 39:472-482, 1936.
6. N. Dershowitz. Orderings for term rewriting systems. Theoretical Computer Science, 17(3):279-301, 1982.
7. R.O. Gandy. Proofs of strong normalization. In J.P. Seldin and J.R. Hindley, editors, To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pages 457-477. Academic Press, 1980.
8. J. Glauert and Z. Khasidashvili. Relative normalization in deterministic residual structures. In Proceedings of the 19th International Colloquium on Trees in Algebras and Programming (CAAP '96), volume 1059 of Lecture Notes in Computer Science, pages 180-195, April 1996.
9. M. Hanus and C. Prehofer. Higher-order narrowing with definitional trees. In H. Ganzinger, editor, Proceedings of the 7th International Conference on Rewriting Techniques and Applications (RTA '96), volume 1103 of Lecture Notes in Computer Science, pages 138-152, New Brunswick, USA, 1996.
10. R. Hindley. Reductions of residuals are finite. Transactions of the Americal Mathematical Society, 240:345-361, June 1978.
11. G. Huet. Confluent reductions: Abstract properties and applications to term rewriting systems. Journal of the Association for Computing Machinery, 27(4):797-821, October 1980.
12. G. Huet and D.C. Oppen. Equations and rewrite rules, a survey. In R.V. Book, editor, Formal Language Theory, Perspectives and Open Problems, pages 349-405. Academic Press, 1980.
13. J.-P. Jouannaud and A. Rubio. The higher-order recursive path ordering. In Proceedings of the 14th annual IEEE Symposium on Logic in Computer Science (LICS '99), Trento, Italy, 1999. To appear.
14. S. Kahrs. Termination proofs in an abstract setting. To appear in Mathematical Structures in Computer Science.
15. Z.O. Khasidashvili. Expression Reduction Systems. In Proceedings of I. Vekua Institute of Applied Mathematics, volume 36, pages 200-220, Tblisi, 1990.
16. J.W. Klop. Combinatory Reduction Systems, volume 127 of Mathematical Centre Tracts. CWI, Amsterdam, 1980. PhD Thesis.
17. D.E. Knuth and P.B. Bendix. Simple word problems in universal algebras. In J. Leech, editor, Computational Problems in Abstract Algebra, pages 263-297. Pergamon Press, 1970.
18. R. Mayr and T. Nipkow. Higher-order rewrite systems and their confluence. Theoretical Computer Science, 192:3-29, 1998.
19. P.-A. Melliès. Description Abstraite des Systèmes de Réécriture. PhD thesis, Université de Paris VII, Paris, France, 1996.
20. A. Middeldorp. Call by need computations to root-stable form. In Proceedings of the 24th Symposium on Principles of Programming Languages (POPL '97), pages 94-105, Paris, France, January 1997. ACM Press.
21. D. Miller. A logic programming language with lambda-abstraction, function variables, and simple unification. Journal of Logic and Computation, 1(4):497-536, 1991.
22. T. Nipkow. Higher-order critical pairs. In Proceedings of the 6th annual IEEE Symposium on Logic in Computer Science (LICS '91), pages 342-349, Amsterdam, The Netherlands, July 1991.
23. T. Nipkow and C. Prehofer. Higher-order rewriting and equational reasoning. In W. Bibel and P. Schmitt, editors, Automated Deduction | A Basis for Applications. Volume I: Foundations, volume 8 of Applied Logic Series, pages 399-430. Kluwer, 1998.
24. M.J. O'Donnell. Computing in Systems Described by Equations, volume 58 of Lecture Notes in Computer Science. Springer Verlag, 1977.
25. V. van Oostrom. Confluence for Abstract and Higher-Order Rewriting. PhDthesis, Vrije Universiteit, Amsterdam, The Netherlands, March 1994.
26. V. van Oostrom. Developing developments. Theoretical Computer Science, 175(1):159-181, 1997.
27. V. van Oostrom. Normalisation in weakly orthogonal rewriting. In Proceedings of the 10th International Conference on Rewriting Techniques and Applications (RTA '99), 1999.
28. J.C. van de Pol. Termination proofs for higher-order rewrite systems. In J. Heering, K. Meinke, B. Möller, and T. Nipkow, editors, Proceedings of the First International Workshop on Higher-Order Algebra, Logic and Term Rewriting (HOA '93), volume 816 of Lecture Notes in Computer Science, pages 305-325, Amsterdam, The Netherlands, 1994.
29. J.C. van de Pol. Termination of Higher-orderRewrite Systems. PhDthesis, Utrecht University, Utrecht, The Netherlands, December 1996.
30. C. Prehofer. Solving Higher-Order Equations: From Logic to Programming. PhD thesis, Technische Universität München, 1995.
31. Z. Qian. Unification of higher-order patterns in linear time and space. Journal of Logic and Computation, 6:315-341, 1996.
32. F. van Raamsdonk. Confluence and Normalisation for Higher-Order Rewriting. PhD thesis, Vrije Universiteit, Amsterdam, The Netherlands, May 1996.
33. B.K. Rosen. Tree-manipulating systems and Church-Rosser theorems. Journal of the Association for Computing Machinery, 20(1):160-187, January 1973.
34. R.C. Sekar and I.V. Ramakrishnan. Programming in equational logic: Beyond strong sequentiality. In Proceedings of the 7th International Symposium on Logic in Computer Science (LICS '90), pages 230-241, 1990.
35. R. de Vrijer. Exactly estimating functionals and strong normalization. Proceedings of the Koninklijke Nederlandse Akademie van Wetenschappen, 90(4), December 1987.
36. R. de Vrijer. Surjective Pairing and Strong Normalization: Two Themes in Lambda Calculus. PhD thesis, Universiteit van Amsterdam, January 1987.
37. H. Zantema. Termination of term rewriting: Interpretation and type elimination. Journal of Symbolic Computation, 17:23-50, 1994.