Skip to main content
SpringerLink
Log in

Extended term rewriting systems

  • Chapter 1 Theory Of Conditional And Horn Clause Systems
  • Conference paper
  • First Online:
Conditional and Typed Rewriting Systems (CTRS 1990)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 516))

Included in the following conference series:

Abstract

In this paper we will consider some extensions of the usual term rewrite format, namely: term rewriting with conditions, infinitary term rewriting and term rewriting with bound variables. Rather than aiming at a complete survey, we discuss some aspects of these three extensions.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Aczel, P. (1978). A general Church-Rosser theorem. Preprint, Univ. of Manchester.

    Google Scholar 

  • Apt, K.R. (1990). Logic Programming. In: Formal models and semantics, Handbook of Theoretical Computer Science, Vol.B (J. van Leeuwen, editor), Elsevier-The MIT Press, Chapter 10, p.493–574.

    Google Scholar 

  • Barendregt, H.P. (1974). Pairing without conventional restraints. Zeitschrift für Math. Logik und Grundl. der Math. 20, p. 289–306.

    Google Scholar 

  • Barendregt, H.P. (1981). The Lambda Calculus, its Syntax and Semantics. 1st ed. North-Holland 1981, 2nd ed. North-Holland 1984.

    Google Scholar 

  • Barendregt, H.P. (1989). Lambda calculi with types. in: Handbook of Logic in Computer Science (eds. S. Abramsky, D. Gabbay and T. Maibaum) Vol.1, Oxford University Press, to appear.

    Google Scholar 

  • Barendregt, H.P. (1989). Functional programming and lambda calculus. In: Formal models and semantics, Handbook of Theoretical Computer Science, Vol.B (J. van Leeuwen, editor), Elsevier — The MIT Press, Chapter 7, p.321–364.

    Google Scholar 

  • Barendregt, H.P., van Eekelen, M.C.J.D., Glauert, J.R.W., Kennaway, J.R., Plasmijer, M.J. & Sleep, M.R. (1987). Term graph rewriting. In: Proc. PARLE Conf., Springer LNCS 259, 141–158.

    Google Scholar 

  • Bergstra, J.A. & Klop, J.W. (1986). Conditional rewrite rules: confluence and termination. JCSS Vol.32, No.3, 1986, 323–362.

    Google Scholar 

  • Böhm, C. (ed.) (1975), λ-Calculus and Computer Science Theory. Springer Lecture Notes in Computer Science 37.

    Google Scholar 

  • Bosco, P.G., Giovanetti, E., Levi, G., Moiso, C. & Palamidessi, C. (1987). A complete semantic characterization of K-LEAF, a logic language with partial functions. Proc. 4th Symp. on Logic Programming, San Francisco (1987).

    Google Scholar 

  • Breazu-Tannen, V. (1988). Combining Algebra and Higher-Order Types. In: Proc. 3rd Symp. on Logic in Computer Science, Edinburgh. 82—90.

    Google Scholar 

  • Chew, P. (1981). Unique normal forms in term rewriting systems with repeated variables. In: Proc. 13th Annual Symp. on the Theory of Computing, 7–18.

    Google Scholar 

  • Church, A. (1941). The calculi of lambda conversion. Annals of Mathematics Studies, Vol.6. Princeton University Press.

    Google Scholar 

  • Dershowitz, N. & Jouannaud, J.-P. (1990). Rewrite systems. In: Formal models and semantics, Handbook of Theoretical Computer Science, Vol.B (J. van Leeuwen, editor), Elsevier — The MIT Press, Chapter 6, p.243–320.

    Google Scholar 

  • Dershowitz, N. & Kaplan, S. (1989). Rewrite, rewrite, rewrite, rewrite, rewrite, Principles of programming languages, Austin, Texas, pp. 250–259.

    Google Scholar 

  • Dershowitz, N., Kaplan, S. & Plaisted, D.A. (1989). Infinite Normal Forms (plus corrigendum), ICALP, pp. 249–262.

    Google Scholar 

  • Dershowitz, N. & Okada, M. (1990). A rationale for conditional equational programming. Theor. Comp. Sci. 75 (1990) 111–138.

    Google Scholar 

  • Dershowitz, N., Okada, M. & Sivakumar, G. (1987). Confluence of Conditional Rewrite Systems. In: Proc. of the 1st International Workshop on Conditional Term Rewrite Systems, Orsay, Springer LNCS 308, 31–44.

    Google Scholar 

  • Dershowitz, N., Okada, M. & Sivakumar, G. (1988). Canonical Conditional Rewrite Systems. In: Proc. of 9th Conf. on Automated Deduction, Argonne, Springer LNCS 310, 538–549.

    Google Scholar 

  • Dershowitz, N. & Plaisted, D.A. (1985). Logic Programming cum Applicative Programming. In: Proc. of the IEEE Symp. on Logic Programming, Boston, 54–66.

    Google Scholar 

  • Dershowitz, N. & Plaisted, D.A. (1987). Equational Programming. In: Machine Intelligence 11 (eds. J.E. Hayes, D. Michie and J. Richards), Oxford University Press, 21–56.

    Google Scholar 

  • Ehrig, H. & Mahr, B. (1985). Fundamentals of Algebraic Specification 1. Equations and Initial Semantics. Springer Verlag.

    Google Scholar 

  • Farmer, W.M. & Watro, R.J. (1989). Redex capturing in term graph rewriting, in Computing with the Curry Chip (eds. W.M. Farmer, J.D. Ramsdell and R.J. Watro), Report M89-59, MITRE.

    Google Scholar 

  • Grätzer, G. (1979). Universal Algebra. (Second Edition). Springer 1979.

    Google Scholar 

  • Hindley, J.R. & Seldin, J.P. (1986). Introduction to Combinators and λ-Calculus. London Mathematical Society Student Texts, Nr.1, Cambridge University Press 1986.

    Google Scholar 

  • Hudak, P. et al (1988). Report on the Functional Programming Language Haskell. Draft Proposed Standard, 1988.

    Google Scholar 

  • Huet, G. (1980). Confluent reductions: Abstract properties and applications to term rewriting systems. Journal of the ACM 27, No.4, p. 797–821.

    Google Scholar 

  • Huet, G. & Lévy, J.-J. (1979). Call-by-need computations in non-ambiguous linear term rewriting systems. Rapport INRIA nr.359.

    Google Scholar 

  • Huet, G. & Lévy, J.-J. (1991). Computations in orthogonal term rewriting systems. In: Computational Logic: Essays in Honour of Alan Robinson (J.-L. Lassez & G. Plotkin, eds.), MIT Press, Cambridge, MA (to appear).

    Google Scholar 

  • Huet, G. & Oppen, D.C. (1980). Equations and rewrite rules: A survey. In: Formal Language Theory: Perspectives and Open Problems (ed. R. Book), Academic Press, 1980, 349–405.

    Google Scholar 

  • Jouannaud, J.-P. & Waldmann, B. (1986). Reductive conditional Term Rewriting Systems. In: Proc. of the 3rd IFIP Working Conf. on Formal Description of Programming Concepts, Ebberup, 223–244.

    Google Scholar 

  • Kaplan, S. (1984). Conditional Rewrite Rules. TCS 33(2,3), 1984.

    Google Scholar 

  • Kaplan, S. (1985). Fair conditional term rewriting systems: Unification, termination and confluence. Recent Trends in Data Type Specification (ed. H.-J. Kreowski), Informatik-Fachberichte 116, Springer-Verlag, Berlin, 1985.

    Google Scholar 

  • Kaplan, S. (1987). Simplifying conditional term rewriting systems: Unification, termination and confluence. J. of Symbolic Computation 4 (3), 1987, 295–334.

    Google Scholar 

  • Kennaway, J.R., Klop, J.W., Sleep, M.R. & de Vries, F.J. (1990a). Transfinite reductions in orthogonal term rewriting systems (Full paper), report CS-R9041, CWI, Amsterdam.

    Google Scholar 

  • Kennaway, J.R., Klop, J.W., Sleep, M.R. & de Vries, F.J. (1990b). An infinitary Church-Rosser property for non-collapsing orthogonal term rewriting systems, report CS-R9043, CWI, Amsterdam.

    Google Scholar 

  • Kennaway, J.R., Klop, J.W., Sleep, M.R. & de Vries, F.J. (1991), Transfinite reductions in orthogonal term rewriting systems, to appear in Proc. RTA '91, Springer LNCS.

    Google Scholar 

  • Kennaway, J.R. & Sleep, M.R. (1989). Neededness is hypernormalizing in regular combinatory reduction systems. Preprint, School of Information Systems, Univ. of East Anglia, Norwich.

    Google Scholar 

  • Klop, J.W. (1987). Term rewriting systems: a tutorial. Bulletin of the EATCS 32, p. 143–182.

    Google Scholar 

  • Klop, J.W. (1980). Combinatory Reduction Systems. Mathematical Centre Tracts Nr.127, CWI, Amsterdam.

    Google Scholar 

  • Klop, J.W. (1991). Term rewriting systems, to appear in Handbook of Logic in Computer Science, Vol I (eds. S. Abramsky, D.Gabbay and T. Maibaum), Oxford University Press.

    Google Scholar 

  • Klop, J.W. & Vrijer, R.C. de (1989). Unique normal forms for lambda calculus with surjective pairing. Information and Computation, Vol.80, No.2, 1989, 97–113.

    Google Scholar 

  • Mann, C.R. (1973). Connections between proof theory and category theory. Dissertation, Oxford University.

    Google Scholar 

  • Meinke, K. & Tucker, J.V. (1990). Universal algebra. In: Handbook of Logic in Computer Science (eds. S. Abramsky, D. Gabbay and T. Maibaum) Vol.1, Oxford University Press, to appear.

    Google Scholar 

  • Middeldorp, A. (1989). Confluence of the Disjoint Union of Conditional Term Rewriting Systems. Report CS-R8944, CWI, Amsterdam (also in this volume).

    Google Scholar 

  • Middeldorp, A. (1990). Modular properties of term rewriting systems. Ph.D. Thesis, Free University Amsterdam.

    Google Scholar 

  • O'Donnell, M.J. (1977). Computing in systems described by equations. Springer Lecture Notes in Computer Science 58.

    Google Scholar 

  • O'Donnell, M.J. (1985). Equational logic as a programming language. The MIT Press, Cambridge MA.

    Google Scholar 

  • Plotkin, G.D. (1977). LCF as a programming language. TCS 5, 223–257.

    Google Scholar 

  • Prawitz, D. (1971). Ideas and results in proof theory. In: Proc. 2nd Scandinavian Logic Symposium (ed. J.E. Fenstad), North-Holland, 235–307.

    Google Scholar 

  • Turner, D.A., (1985). Miranda: a non-strict functional language with polymorphic types. In J.-P. Jouannaud (ed.), Proc. ACM Conf. on Functional Programming Languages and Computer Architecture, LNCS, vol. 201, Springer-Verlag.

    Google Scholar 

  • Vrijer, R.C. de (1987). Surjective pairing and strong normalization: two themes in lambda calculus. Dissertation, University of Amsterdam.

    Google Scholar 

  • Vrijer, R.C. de (1989). Extending the lambda calculus with surjective pairing is conservative. In Proc. of the 4th Annual IEEE Symposium on Logic in Computer Science, Pacific Grove, p. 204–215.

    Google Scholar 

  • Vrijer, R.C. de (1990). Unique normal forms for Combinatory Logic with Parallel Conditional, a case study in conditional rewriting. Techn. Report Free University Amsterdam, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CWI, Kruislaan 413, 1098 SJ, Amsterdam, The Netherlands

    Jan Willem Klop

  2. Dept. of Math. and Comp. Sci., Free University, De Boelelaan 1081a, 1081 HV, Amsterdam, The Netherlands

    Jan Willem Klop & Roel de Vrijer

  3. Dept. of Philosophy, University of Amsterdam, Nieuwe Doelenstraat 15, 1012 CP, Amsterdam, The Netherlands

    Roel de Vrijer

Authors
  1. Jan Willem Klop
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Roel de Vrijer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

S. Kaplan M. Okada

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Klop, J.W., de Vrijer, R. (1991). Extended term rewriting systems. In: Kaplan, S., Okada, M. (eds) Conditional and Typed Rewriting Systems. CTRS 1990. Lecture Notes in Computer Science, vol 516. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54317-1_79

Download citation

  • DOI: https://doi.org/10.1007/3-540-54317-1_79

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54317-6

  • Online ISBN: 978-3-540-47558-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation