A Two-Category Approach to Critical Pair Completion

The categorical presentation of the CPC algorithm scheme exposes the essential ingredients of the CPC algorithm scheme which are independent from the syntacic surface. This insight is a sufficient basis to transfer the CPC algorithm scheme to other formalisms. In mathematics on the metalevel only product types have been used so far. But, in recently used higher order formalisms the function type came additionally into use.

[1]  F. W. Lawvere,et al.  FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES. , 1963, Proceedings of the National Academy of Sciences of the United States of America.

[2]  John Power.  An Abstract Formulation for Rewrite Systems , 1989, Category Theory and Computer Science.

[3]  Michael Makkai,et al.  Accessible categories: The foundations of categorical model theory, , 2007 .

[4]  Bruno Buchberger,et al.  History and Basic Features of the Critical-Pair/Completion Procedure , 1987, J. Symb. Comput..

[5]  Eugenio Moggi,et al.  A category-theoretic account of program modules , 1989, Mathematical Structures in Computer Science.

[6]  David E. Rydeheard,et al.  Foundations of Equational Deduction: A Categorical Treatment of Equational Proofs and Unification Algorithms , 1987, Category Theory and Computer Science.