Part 3: Contributed PapersInternational audienceIt 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
AbstractWe define a general notion of (syntactic) unification, the (π→τ→ )-unification, whose specia...
. We show that deciding unification modulo both-sided distributivity of a symbol over a symbol + ca...
209 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1993.Unification is central to aut...
Abstract. In this paper, we seek to understand limits, a unifying notion that brings together the id...
A standard result from unification theory says that if a finite set E of equations between finite te...
AbstractUnification is the problem to solve equations of first order terms by finding (all) substitu...
In a dependently typed language such as Coq or Agda, unification can be used to discharge equality c...
In this note we present the basic theory of substitutions and a unification algorithm expressed in a...
Abstract. Motivated by applications to Mackey functors, Serge Bouc [Bo] character-ized pullback and ...
We present algorithms for unification and antiunification in the Calculus of Constructions, where oc...
We present restricted T-unification that is unification of terms under a given equational theory T w...
Motivated by applications to Mackey functors, Serge Bouc [Bo] characterized pullback and finite copr...
AbstractA substitution δ is less general than a substitution σ if there exists λ such that δ=σ⋅λ, wh...
In this paper the set of first order substitutions with a partial ordering “more general than” is in...
AbstractIn category theory, most set-theoretic constructions–union, intersection, etc.–have direct c...
AbstractWe define a general notion of (syntactic) unification, the (π→τ→ )-unification, whose specia...
. We show that deciding unification modulo both-sided distributivity of a symbol over a symbol + ca...
209 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1993.Unification is central to aut...
Abstract. In this paper, we seek to understand limits, a unifying notion that brings together the id...
A standard result from unification theory says that if a finite set E of equations between finite te...
AbstractUnification is the problem to solve equations of first order terms by finding (all) substitu...
In a dependently typed language such as Coq or Agda, unification can be used to discharge equality c...
In this note we present the basic theory of substitutions and a unification algorithm expressed in a...
Abstract. Motivated by applications to Mackey functors, Serge Bouc [Bo] character-ized pullback and ...
We present algorithms for unification and antiunification in the Calculus of Constructions, where oc...
We present restricted T-unification that is unification of terms under a given equational theory T w...
Motivated by applications to Mackey functors, Serge Bouc [Bo] characterized pullback and finite copr...
AbstractA substitution δ is less general than a substitution σ if there exists λ such that δ=σ⋅λ, wh...
In this paper the set of first order substitutions with a partial ordering “more general than” is in...
AbstractIn category theory, most set-theoretic constructions–union, intersection, etc.–have direct c...
AbstractWe define a general notion of (syntactic) unification, the (π→τ→ )-unification, whose specia...
. We show that deciding unification modulo both-sided distributivity of a symbol over a symbol + ca...
209 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1993.Unification is central to aut...