Abstract
In this paper term rewriting is modelled by use of a h-category framework, where 0-cells represent sets of variables, morphisms represent substitutions and contexts and 2-morphisms represent reduction rules. In this context stability and compatibility properties of reduction can be proved. The proposed categorial view allows for a good level of expressivity of the reduction mechanisms, without constraining rewriting to the particular area where it is defined. Moreover, it seems to be a promising framework for the embedding of algebraic reduction.
This work has been partially supported by the Italian Project MURST ex 40% ”Rappresentazione della Conoscenza e Meccanismi di Ragionamento
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Balestreri G. (1992) External and Internal Rewriting Internal Report n. 13/1992 I.A.C. CNR Italy.
Balestreri G., Mascari G. (1992) Concurrent Rewriting and Knuth Bendix Completion Theorem in a — Category Internal Report n. 15/1992 I.A.C. CNR Italy.
Benabou J., Lectures held in Rome at the Mathematics Departement of University La Sapienza, 1991.
Buchberger B. (1976) A Theoretical Basis for the reduction of polynomials to canonical form ACM SIGSAM Bull. 10/4 (19–24).
Buchberger B. (1985) Grobner Bases: An Algorithmic Method in Polynomial Ideal Theory. Multi-dimensional Systems Theory, (ed. N.K. Bose), D. Reidel Publ. Comp.(184–232).
Buchberger B., Loos R. (1983) Algebraic Simplification. Computer AlgebraSymbolic and Algebraic Computation, 2nd ed. Springer, (11–43).
Dershowitz N., Jouannaud J.P. (1990) Rewrite Systems Handbook of Theoretical Computer Science, chapter 15 (243–320).
Fay M. (1979) First Order unification in an equational Theory Proc. fourth workshop on automated deduction Austin Texas (161–167).
Grandis M. (1991) Homotopical Algebra: a two-dimensional categorical setting Internal Report n. 191/1991 Dept. Mat. University of Genova-Italy.
Huet G., Hullot J.M. (1982) Proof by Induction in Equational Theories With Constructors J.A.C.M. 25/2 (239–266).
Huet G., Oppen D.C. (1980) Equations and Rewrite Rules — A Survay. Formal Language Theory, (ed. R.V. Book), Academic Press, (349–405).
Huet G. (1980) Deduction and Computation. L.N.C.S. 232 (39–74).
Huet G. (1980) Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems. J.ACM 27/4, (797–821).
Jouannaud J.P., Kirchner H. (1986) Completion of a set of rules modulo a set of equations SIAM J. Comp. Vol 15/4.
Jouannaud J.P., Kounalis E. (1989) Automatic proofs by induction in equational theories without constructors Information and Computation 82 (1–33).
Klop J.W. (1990) Term Rewriting Systems. C.W.I. Amsterdam rep.CS-R9073.
Knuth D.E., Bendix P.B. (1970) Simple word problems in universal algebras. Computational Problems in Abstract Algebra (ed. J. Leech), Pergamon Press, 1970, (263–279).
Lankford D. (1975) Canonical Inference Memo ATP-32 Aut. Theor. Prov. Project. Univ. Texas.
Loos R. (1974) Toward a formal implementation of Computer Algebra EUROSAM 1974 (9–16).
MacLane S. (1971) Categories for the Working Mathematician Vol. 5 Graduate Texts in Mathematics. Springer Verlag.
Meseguer J. (1992) Conditional rewriting as a unified model of concurrency T.C.S. 96 (73–155).
O'Donnell M.J. (1977) Computing in systems described by equations L.N.C.S. 58.
O'Donnell M.J., Hoffman C. (1984) Implementation of an Interpreter of abstract equations Proc. 12th POPL.
Peterson G.E., Stickel M.E. (1981) Complete sets of reductions for some equational theories J. ACM 28/2 (233–264).
Rydeheard D.E., Stell J.G. (1987) Foundation of Equational Deduction: A Categorical Treatment of Equational Proofs and Unification Algorithms L.N.C.S. 283 (114–139).
Steel J.G. (1992) Categorical Aspect of Unification and Rewriting Ph.D. Thesis, University of Manchester.
Stokkermans K. (1992) A Categorical Formulation for Critical Pair Completion Procedures L.N.C.S. 656 (328–342).
Winkler F. (1989) Knuth-Bendix Procedure and Buchberger Algorithm: A Synthesis ISAAC-89 (1–8).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Balestreri, G. (1996). Term rewriting systems: An h-categorical semantic. In: Calmet, J., Limongelli, C. (eds) Design and Implementation of Symbolic Computation Systems. DISCO 1996. Lecture Notes in Computer Science, vol 1128. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61697-7_8
Download citation
DOI: https://doi.org/10.1007/3-540-61697-7_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61697-9
Online ISBN: 978-3-540-70635-9
eBook Packages: Springer Book Archive