Home
Scholarly Works
Finite Limits and Anti-unification in Substitution...
Conference

Finite Limits and Anti-unification in Substitution Categories

Abstract

It is well-known that coequalisers and pushouts of substitutions correspond to solutions of unification problems, and therefore do not always exist. But how about equalisers and pullbacks? If the literature contains the answers, they are well-hidden.We provide explicit details and proofs for these constructions in categories with substitutions as morphisms, and in particular work out the details of categorial products for which the universal arrow construction turns out to correspond exactly to anti-unification.

Authors

Kahl W

Series

Lecture Notes in Computer Science

Volume

11563

Pagination

pp. 87-102

Publisher

Springer Nature

Publication Date

January 1, 2019

DOI

10.1007/978-3-030-23220-7_5

Conference proceedings

Lecture Notes in Computer Science

ISSN

0302-9743

Labels

View published work (Non-McMaster Users)

Contact the Experts team