%0 Conference Proceedings
%T Finite Limits and Anti-unification in Substitution Categories
%+ McMaster University [Hamilton, Ontario]
%A Kahl, Wolfram
%Z Part 3: Contributed Papers
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 24th International Workshop on Algebraic Development Techniques (WADT)
%C Egham, United Kingdom
%Y José Luiz Fiadeiro
%Y Ionuț Țuțu
%I Springer International Publishing
%3 Recent Trends in Algebraic Development Techniques
%V LNCS-11563
%P 87-102
%8 2018-07-02
%D 2018
%R 10.1007/978-3-030-23220-7_5
%Z Computer Science [cs]Conference papers
%X 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.
%G English
%Z TC 1
%Z WG 1.3
%2 https://inria.hal.science/hal-02364568/document
%2 https://inria.hal.science/hal-02364568/file/486157_1_En_5_Chapter.pdf
%L hal-02364568
%U https://inria.hal.science/hal-02364568
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-WG1-3
%~ IFIP-WADT
%~ IFIP-LNCS-11563