The following pages link to (Q4725721):
Displaying 24 items.
- Adding fuzziness to terms and powerobjects using a monadic approach (Q419043) (← links)
- Constraint logic programming with a relational machine (Q511023) (← links)
- Unification in commutative theories (Q582071) (← links)
- Determinisation of relational substitutions in ordered categories with domain (Q604457) (← links)
- Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming (Q685465) (← links)
- On the algebraic structure of declarative programming languages (Q1035699) (← links)
- Contraction algebras and unification of (infinite) terms (Q1185240) (← links)
- An algebraic semantics for structured transition systems and its application to logic programs (Q1199528) (← links)
- A new framework for declarative programming (Q1399960) (← links)
- Set functors, \(L\)-fuzzy set categories, and generalized terms. (Q1609131) (← links)
- Similarities between powersets of terms (Q1827316) (← links)
- An efficient labelled nested multiset unification algorithm (Q2152299) (← links)
- Powersets of terms and composite monads (Q2457025) (← links)
- A categorical approach to unification of generalised terms1 1This work has been developed as a cooperation organised within COST 274. (Q2842593) (← links)
- Declarative Compilation for Constraint Logic Programming (Q2949715) (← links)
- Determinisation of Relational Substitutions in Ordered Categories with Domain (Q3498418) (← links)
- Partially Ordered Monads and Rough Sets (Q3600299) (← links)
- Categorical Innovations for Rough Sets (Q3628686) (← links)
- (Q3994022) (← links)
- (Q4611382) (← links)
- A graphical approach to monad compositions (Q4923371) (← links)
- Partially Ordered Monads for Monadic Topologies, Rough Sets and Kleene Algebras (Q4982052) (← links)
- Unification, weak unification, upper bound, lower bound, and generalization problems (Q5055751) (← links)
- Unique-sort order-sorted theories : A description as monad morphisms (Q5881299) (← links)
