A Relation Algebra for Term Rewriting: A differential approach to sequential reduction (Revised Version) (2312.02996v1)
Abstract: Recently, Gavazzo has developed a relational theory of symbolic manipulation, that allows to study syntax-based rewriting systems without relying on specific notions of syntax. This theory was obtained by extending the algebra of relations with syntax-inspired operators. Within the algebras thus obtained, it is possible to encode notions of parallel and full reduction for first-order rewriting systems, as well as to prove nontrivial properties about them in an algebraic and syntax-independent fashion. Sequential reduction, however, was not explored, but it was conjectured that it could be studied through a differential relational theory of rewriting. This manuscript proves the above conjecture by defining differential algebras of term relations, viz. algebras of term relations extended with novel operators inspired by the theory of functor derivatives. We give a set of axioms and rules for such operators and show that the resulting theory is expressive enough to define notions of parallel, full, and sequential reduction. We prove fundamental results relating all these notions in a purely algebraic and syntax-independent way, and showcase the effectiveness of our theory by proving the soundness of a proof technique for weak confluence akin to the so-called Critical Pair Lemma.
- Derivatives of containers. In Martin Hofmann, editor, Proc. of TLCA 2003, volume 2701 of Lecture Notes in Computer Science, pages 16–30. Springer, 2003.
- Compilers-principles, techniques, and tools. pearson Education, 2007.
- Polynomial relators (extended abstract). In Proc. of (AMAST ’91, Workshops in Computing, pages 303–326. Springer, 1991.
- H.P. Barendregt. The lambda calculus: its syntax and semantics. Studies in logic and the foundations of mathematics. North-Holland, 1984.
- M. Barr. Relational algebras. Lect. Notes Math., 137:39–55, 1970.
- Han Bäumer. On the use of relation algebra in the theory of reduction systems. In CSN, volume 92, page 5464, 1992.
- Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 2003.
- Algebra of programming. Prentice Hall International series in computer science. Prentice Hall, 1997.
- A 2222-categorical approach to change of base and geometric morphisms i. Cahiers de Topologie et Géométrie Différentielle Catégoriques, 32(1):47–95, 1991.
- Introduction to lattices and order. Cambridge University Press, 1990.
- A calculational approach to mathematical induction. Theor. Comput. Sci., 179(1-2):103–135, 1997.
- The differential lambda-calculus. Theoretical Computer Science, 309(1-3):1–41, 2003.
- Abstract syntax and variable binding. In 14th Annual IEEE Symposium on Logic in Computer Science, Trento, Italy, July 2-5, 1999, pages 193–202. IEEE Computer Society, 1999.
- Categories, allegories, volume 39 of North-Holland mathematical library. North-Holland, 1990.
- A new approach to abstract syntax involving binders. In 14th Annual IEEE Symposium on Logic in Computer Science, Trento, Italy, July 2-5, 1999, pages 214–224. IEEE Computer Society, 1999.
- Francesco Gavazzo. Allegories of symbolic manipulations. In LICS, pages 1–15, 2023.
- Rewriting via coinserters. Nord. J. Comput., 10(4):290–312, 2003.
- Jean-Yves Girard. Linear logic. Theor. Comput. Sci., 50:1–102, 1987.
- Initial algebra semantics and continuous algebras. J. ACM, 24(1):68–95, 1977.
- A.D. Gordon. A tutorial on co-induction and functional programming. In Workshops in Computing, pages 78–95. Springer London, September 1994.
- Andrew D. Gordon. Bisimilarity as a theory of functional programming. In Stephen D. Brookes, Michael G. Main, Austin Melton, and Michael W. Mislove, editors, Proc. of MFPS 1995, volume 1 of Electronic Notes in Theoretical Computer Science, pages 232–252. Elsevier, 1995.
- Håkon Robbestad Gylterud. Symmetric containers. Master’s thesis, 2011.
- Nicholas J Higham. Accuracy and stability of numerical algorithms. SIAM, 2002.
- D.J. Howe. Proving congruence of bisimulation in functional programming languages. Inf. Comput., 124(2):103–112, 1996.
- The term rewriting approach to automated theorem proving. The Journal of Logic Programming, 14(1):71–99, 1992.
- Gérard P. Huet. Confluent reductions: Abstract properties and applications to term rewriting systems: Abstract properties and applications to term rewriting systems. J. ACM, 27(4):797–821, 1980.
- Bart Jacobs and Jan J. M. M. Rutten. A tutorial on (co)algebras and (co)induction. Bulletin of The European Association for Theoretical Computer Science, 1997.
- André Joyal. Foncteurs analytiques et espèces de structures. Comptes rendus de l’Académie des sciences. Série I. Mathématique, 298(15):393–396, 1984.
- Yasuo Kawahara. Notes on the universality of relational functors. Memoirs of the Faculty of Science, Kyushu University. Series A, Mathematics, 27(2):275–289, 1973.
- A. Kurz and J. Velebil. Relation lifting, a survey. J. Log. Algebr. Meth. Program., 85(4):475–499, 2016.
- S.B. Lassen. Relational Reasoning about Functions and Nondeterminism. PhD thesis, Dept. of Computer Science, University of Aarhus, May 1998.
- S. MacLane. Categories for the Working Mathematician. Springer-Verlag, 1971.
- CORPORATE Mathematics of Program Construction Group. Fixed-point calculus. Information Processing Letters, 53(3):131–136, 1995.
- Conor Mcbride. The derivative of a regular type is its type of one-hole contexts (extended abstract). 04 2009.
- M. H. A. Newman. On theories with a combinatorial definition of ”equivalence”. Annals of Mathematics, 43(2):223–243, 1942.
- Benjamin C Pierce. Types and programming languages. MIT press, 2002.
- A.M. Pitts. Howe’s method for higher-order languages. In D. Sangiorgi and J. Rutten, editors, Advanced Topics in Bisimulation and Coinduction, volume 52 of Cambridge Tracts in Theoretical Computer Science, pages 197–232. Cambridge University Press, 2011.
- Relation algebra and kat in coq.
- K.I. Rosenthal. Quantales and their applications. Pitman research notes in mathematics series. Longman Scientific & Technical, 1990.
- Gunther Schmidt. Relational Mathematics, volume 132 of Encyclopedia of Mathematics and its Applications. Cambridge University Press, 2011.
- M. Spivak. Calculus On Manifolds: A Modern Approach To Classical Theorems Of Advanced Calculus. Avalon Publishing, 1971.
- Georg Struth. Calculating church-rosser proofs in kleene algebra. In Harrie C. M. de Swart, editor, Proc. of RelMICS 2001, volume 2561 of Lecture Notes in Computer Science, pages 276–290. Springer, 2001.
- Georg Struth. Abstract abstract reduction. J. Log. Algebraic Methods Program., 66(2):239–270, 2006.
- Alfred Tarski. On the calculus of relations. J. Symb. Log., 6(3):73–89, 1941.
- William F Trench. Introduction to real analysis. 2013.