This HTML5 document contains 85 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dbpedia-shhttp://sh.dbpedia.org/resource/
dctermshttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n15https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
n33https://www.schoolofhaskell.com/user/edwardk/recursion-schemes/
dbthttp://dbpedia.org/resource/Template:
n25http://dl.acm.org/
rdfshttp://www.w3.org/2000/01/rdf-schema#
n10http://lorgonblog.wordpress.com/2008/05/24/catamorphisms-part-four/
n7http://lorgonblog.wordpress.com/2008/04/05/catamorphisms-part-one/
n18http://lorgonblog.wordpress.com/2008/05/31/catamorphisms-part-five/
freebasehttp://rdf.freebase.com/ns/
n13http://lorgonblog.wordpress.com/2008/06/07/catamorphisms-part-seven/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
n9http://lorgonblog.wordpress.com/2008/04/09/catamorphisms-part-three/
n24http://bs.dbpedia.org/resource/
dbpedia-frhttp://fr.dbpedia.org/resource/
wikipedia-enhttp://en.wikipedia.org/wiki/
n8http://lorgonblog.wordpress.com/2008/04/06/catamorphisms-part-two/
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
n20http://ulissesaraujo.wordpress.com/2007/12/19/catamorphisms-in-haskell/
dbpedia-nlhttp://nl.dbpedia.org/resource/
dbrhttp://dbpedia.org/resource/
dbpedia-jahttp://ja.dbpedia.org/resource/
n11http://lorgonblog.wordpress.com/2008/06/02/catamorphisms-part-six/
n12http://www.haskell.org/haskellwiki/

Statements

Subject Item
dbr:Catamorphism
rdf:type
yago:Abstraction100002137 yago:Cognition100023271 yago:PsychologicalFeature100023100 yago:Content105809192 yago:Idea105833840 yago:Scheme105905348 owl:Thing yago:WikicatRecursionSchemes yago:Plan105898568 yago:PlanOfAction105902545
rdfs:label
Catamorphisme Catamorphism Catamorfisme Catamorphism
rdfs:comment
圏論において、Catamorphism(ギリシャ語: κατά = 下方へ または ~に従って; μορφή = 形式 または 形)は、始代数から他の代数への唯一の準同型射を意味する。この概念は関数型プログラミングへfoldとして応用されている。 はこの双対となる概念である。も参照。 Het concept van een catamorfisme is gegrond in de categorietheorie en is toegepast in het functioneel programmeren. Het geeft het unieke homomorfisme aan voor een . De term komt uit het Grieks κατα- (naar beneden) + morfisme, ook uit het Grieks μορφή (vorm). Het duale concept is dat van een anamorfisme. Dans la théorie des catégories, le concept de catamorphisme (du Grec: κατα- = vers le bas; morphisme = forme) dénote l'unique homomorphisme pour une algèbre initiale. Le concept a été appliqué dans la programmation fonctionnelle. Le concept dual est celui d'anamorphisme. In category theory, the concept of catamorphism (from the Ancient Greek: κατά "downwards" and μορφή "form, shape") denotes the unique homomorphism from an initial algebra into some other algebra. In functional programming, catamorphisms provide generalizations of folds of lists to arbitrary algebraic data types, which can be described as initial algebras. The dual concept is that of anamorphism that generalize unfolds. A hylomorphism is the composition of an anamorphism followed by a catamorphism.
owl:differentFrom
dbr:Anamorphism
dcterms:subject
dbc:Functional_programming dbc:Recursion_schemes dbc:Morphisms dbc:Category_theory dbc:Iteration_in_programming
dbo:wikiPageID
4237146
dbo:wikiPageRevisionID
1039413699
dbo:wikiPageWikiLink
dbc:Morphisms dbr:Anamorphism dbr:F-algebra dbr:Erik_Meijer_(computer_scientist) dbc:Recursion_schemes dbc:Category_theory dbr:Fold_(higher-order_function) dbr:List_(computing) dbr:Morphism dbr:Homomorphism dbr:Grant_Malcolm dbr:Hylomorphism_(computer_science) dbr:Initial_algebra dbr:Paramorphism dbc:Iteration_in_programming dbr:Category_theory dbr:Functional_programming dbr:F_Sharp_(programming_language) dbr:Endofunctor dbr:Category_(mathematics) dbr:Apomorphism dbr:Haskell_(programming_language) dbr:Ancient_Greek dbr:Squiggol dbr:Algebraic_data_type dbc:Functional_programming
dbo:wikiPageExternalLink
n7: n8: n9: n10: n11: n12:Catamorphisms n13: n18: n20: n25:citation.cfm%3Fid=2034807 n33:catamorphisms
owl:sameAs
n15:sNCk dbpedia-fr:Catamorphisme wikidata:Q1959790 dbpedia-nl:Catamorfisme n24:Regresivna_evolucija yago-res:Catamorphism dbpedia-sh:Regresivna_evolucija dbpedia-ja:Catamorphism freebase:m.0brhqt
dbp:wikiPageUsesTemplate
dbt:Refbegin dbt:Refend dbt:Reflist dbt:Cite_conference dbt:Confuse dbt:Wikt-lang
dbo:abstract
Dans la théorie des catégories, le concept de catamorphisme (du Grec: κατα- = vers le bas; morphisme = forme) dénote l'unique homomorphisme pour une algèbre initiale. Le concept a été appliqué dans la programmation fonctionnelle. Le concept dual est celui d'anamorphisme. Het concept van een catamorfisme is gegrond in de categorietheorie en is toegepast in het functioneel programmeren. Het geeft het unieke homomorfisme aan voor een . De term komt uit het Grieks κατα- (naar beneden) + morfisme, ook uit het Grieks μορφή (vorm). Het duale concept is dat van een anamorfisme. In category theory, the concept of catamorphism (from the Ancient Greek: κατά "downwards" and μορφή "form, shape") denotes the unique homomorphism from an initial algebra into some other algebra. In functional programming, catamorphisms provide generalizations of folds of lists to arbitrary algebraic data types, which can be described as initial algebras. The dual concept is that of anamorphism that generalize unfolds. A hylomorphism is the composition of an anamorphism followed by a catamorphism. 圏論において、Catamorphism(ギリシャ語: κατά = 下方へ または ~に従って; μορφή = 形式 または 形)は、始代数から他の代数への唯一の準同型射を意味する。この概念は関数型プログラミングへfoldとして応用されている。 はこの双対となる概念である。も参照。
prov:wasDerivedFrom
wikipedia-en:Catamorphism?oldid=1039413699&ns=0
dbo:wikiPageLength
13111
foaf:isPrimaryTopicOf
wikipedia-en:Catamorphism