In mathematics, specifically in category theory, an -algebra is a structure defined according to a functor . -algebras can be used to represent data structures used in programming, such as lists and trees. Initial -algebras encapsulate an induction principle. -algebras are dual to -coalgebras.

PropertyValue
dbpedia-owl:abstract
  • In mathematics, specifically in category theory, an -algebra is a structure defined according to a functor . -algebras can be used to represent data structures used in programming, such as lists and trees. Initial -algebras encapsulate an induction principle. -algebras are dual to -coalgebras.
dbpedia-owl:thumbnail
dbpedia-owl:wikiPageExternalLink
dcterms:subject
rdfs:comment
  • In mathematics, specifically in category theory, an -algebra is a structure defined according to a functor . -algebras can be used to represent data structures used in programming, such as lists and trees. Initial -algebras encapsulate an induction principle. -algebras are dual to -coalgebras.
rdfs:label
  • F-algebra
owl:sameAs
foaf:depiction
foaf:page
is dbpedia-owl:wikiPageRedirects of
is owl:sameAs of
is foaf:primaryTopic of