| dbo:abstract
|
- Le paramorphisme (du Grec: παρά- = vers le haut; morphisme = forme) est un concept de la programmation fonctionnelle fondé sur la théorie des catégories. C'est une extension de la notion de catamorphisme. (fr)
- In formal methods of computer science, a paramorphism (from Greek παρά, meaning "close together") is an extension of the concept of catamorphism first introduced by Lambert Meertens to deal with a form which “eats its argument and keeps it too”, as exemplified by the factorial function. Its categorical dual is the apomorphism. It is a more convenient version of catamorphism in that it gives the combining step function immediate access not only to the result value recursively computed from each recursive subobject, but the original subobject itself as well. Example Haskell implementation, for lists: cata :: (a -> b -> b) -> b -> [a] -> bpara :: (a -> ([a], b) -> b) -> b -> [a] -> bana :: (b -> (a, b)) -> b -> [a]apo :: (b -> (a, Either [a] b)) -> b -> [a]cata f b (a:as) = f a (cata f b as)cata _ b [] = bpara f b (a:as) = f a (as, para f b as)para _ b [] = bana u b = case u b of (a, b') -> a : ana u b'apo u b = case u b of (a, Right b') -> a : apo u b' (a, Left as) -> a : as (en)
|
| dbo:wikiPageExternalLink
| |
| dbo:wikiPageID
| |
| dbo:wikiPageLength
|
- 2985 (xsd:nonNegativeInteger)
|
| dbo:wikiPageRevisionID
| |
| dbo:wikiPageWikiLink
| |
| dbp:wikiPageUsesTemplate
| |
| dcterms:subject
| |
| gold:hypernym
| |
| rdf:type
| |
| rdfs:comment
|
- Le paramorphisme (du Grec: παρά- = vers le haut; morphisme = forme) est un concept de la programmation fonctionnelle fondé sur la théorie des catégories. C'est une extension de la notion de catamorphisme. (fr)
- In formal methods of computer science, a paramorphism (from Greek παρά, meaning "close together") is an extension of the concept of catamorphism first introduced by Lambert Meertens to deal with a form which “eats its argument and keeps it too”, as exemplified by the factorial function. Its categorical dual is the apomorphism. It is a more convenient version of catamorphism in that it gives the combining step function immediate access not only to the result value recursively computed from each recursive subobject, but the original subobject itself as well. (en)
|
| rdfs:label
|
- Paramorphisme (fr)
- Paramorphism (en)
|
| owl:sameAs
| |
| prov:wasDerivedFrom
| |
| foaf:isPrimaryTopicOf
| |
| is dbo:wikiPageWikiLink
of | |
| is foaf:primaryTopic
of | |
