Change search
ReferencesLink to record
Permanent link

Direct link
Powersets of terms and composite monads
Umeå University, Faculty of Science and Technology, Department of Computing Science.
Show others and affiliations
2007 (English)In: Fuzzy sets and systems (Print), ISSN 0165-0114, Vol. 158, no 23, 2552-2574 p.Article in journal (Refereed) Published
Abstract [en]

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.
Keyword [en]
Composite monads, generalized terms, many-valued logic
URN: urn:nbn:se:umu:diva-21918DOI: 10.1016/j.fss.2007.06.002ISI: 000250744700002ISBN: 0165-0114OAI: diva2:212170
Available from: 2009-04-21 Created: 2009-04-21 Last updated: 2011-04-08Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Eklund, Patrik
By organisation
Department of Computing Science
In the same journal
Fuzzy sets and systems (Print)

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 27 hits
ReferencesLink to record
Permanent link

Direct link