Powersets of terms and composite monads
2007 (English)In: Fuzzy sets and systems (Print), ISSN 0165-0114, Vol. 158, no 23, 2552-2574 p.Article in journal (Refereed) Published
Composing various powerset functors with the term monad gives rise to the concept of generalized 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. (C) 2007 Elsevier B.V. All rights reserved.
Place, publisher, year, edition, pages
Amsterdam: North-Holland , 2007. Vol. 158, no 23, 2552-2574 p.
Composite monads, generalized terms, many-valued logic
IdentifiersURN: urn:nbn:se:umu:diva-21918DOI: 10.1016/j.fss.2007.06.002ISI: 000250744700002ISBN: 0165-0114OAI: oai:DiVA.org:umu-21918DiVA: diva2:212170