Powersets of Terms and Composite Monads
2004 (English)In: Technical Report, UMINF, ISSN 0348-0542, no 7Article in journal (Refereed) Published
Composing various powerset functors with the term monad gives rise to the concept of generalised terms. This in turn provides a technique for handling many-valued sets of terms in a framework of variable substitutions, thus being the prerequisite for categorical unification in many-valued logic programming using an extended notion of terms. As constructions of monads involve complicated calculations with natural transformations, proofs are supported by a graphical approach that provides a useful tool for handling various conditions, such as those well-known for distributive laws.
Place, publisher, year, edition, pages
Umeå: Department of Computing Science , 2004. no 7
Composite monads, generalised terms, many-valued logic
IdentifiersURN: urn:nbn:se:umu:diva-3900OAI: oai:DiVA.org:umu-3900DiVA: diva2:142799