Hostname: page-component-848d4c4894-cjp7w Total loading time: 0 Render date: 2024-06-16T13:09:03.954Z Has data issue: false hasContentIssue false
  • English
  • Français

Termination and confluence in infinitary term rewriting

Published online by Cambridge University Press:  12 March 2014

P. H. Rodenburg
P. H. Rodenburg*
Affiliation:
Programming Research Group, University of Amsterdam, E-mail: pietr@wins.uva.nl
Get access Rights & Permissions [Opens in a new window]

Abstract

The basic notions of the theory of term rewriting are defined for terms that may involve function letters of infinite arity. A sufficient condition for completeness is derived, and its use demonstrated by the example of abstract clones over infinitary signatures.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 63 , Issue 4 , December 1998 , pp. 1286 - 1296
Copyright
Copyright © Association for Symbolic Logic 1998

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1] Huet, G., Confluent reductions: Abstract properties and applications to term rewriting systems, Journal of the ACM, vol. 27 (1980), pp. 797–821.Google Scholar
[2] Kennaway, J. R., Klop, J. W., Sleep, M. R., and de Vries, F. J., Transfinite reductions in orthogonal term rewriting systems, Information and Computation, vol. 119 (1995), pp. 18–38.Google Scholar
[3] Klop, J. W., Term rewriting systems, Handbook of logic in computer science (Abramsky, S., Gabbay, D. M., and Maibaum, T. S. E., editors), vol. 2, Cambridge, 1985, pp. 1–116.Google Scholar
[4] Lambek, J. and Scott, R J., Introduction to higher order categorical logic, Cambridge, 1986.Google Scholar
[5] Meseguer, J. and Goguen, J. A., Initiality, induction and computability, Algebraic methods in semantics (Nivat, M. and Reynolds, J. C., editors), Cambridge, 1985, pp. 459–541.Google Scholar