A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Determinisation of relational substitutions in ordered categories with domain
2010
The Journal of Logic and Algebraic Programming
Restating a unification problem as a single relational substitution instead of as multiple functional substitutions (or terms), a solution becomes a "determiniser" arrow and allows formalisation in the context of locally ordered categories with domain. This relies on the determinacy concept of "characterisation by domain" introduced by Desharnais and Möller for Kleene algebras with domain; this is here applied in the weakest possible setting. We show how "most general determinisers" can be seen
doi:10.1016/j.jlap.2010.07.017
fatcat:qs3h4py5t5azth2xpnskiywna4