Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Corecursion> ?p ?o. }
Showing items 1 to 30 of
30
with 100 items per page.
- Corecursion abstract "In computer science, corecursion is a type of operation that is dual to recursion. Whereas recursion works analytically, starting on data further from a base case and breaking it down into smaller data and repeating until one reaches a base case, corecursion works synthetically, starting from a base case and building it up, iteratively producing data further removed from a base case. Put simply, corecursive algorithms use the data that they themselves produce, bit by bit, as they become available, and needed, to produce further bits of data. Some authors refer to this as generative recursion.Where recursion allows programs to operate on arbitrarily complex data, so long as it can be reduced to simple data (base cases), corecursion allows programs to produce arbitrarily complex and potentially infinite data structures, such as streams, so long as it can be produced from simple data (base cases). Where recursion may not terminate, never reaching a base state, corecursion starts from a base state, and thus produces subsequent steps deterministically, but the result may be infinite (and thus not terminate). Many functions that are traditionally analyzed as recursive can alternatively, and arguably more naturally, be interpreted as corecursive function that are terminated at a given stage, for example recurrence relations such as the factorial.Corecursion can produce both finite and infinite data structures as result, and may employ self-referential data structures. Corecursion is often used in conjunction with lazy evaluation, to only produce a finite subset of a potentially infinite structure (rather than trying to produce an entire infinite structure at once). Corecursion is a particularly important concept in functional programming, where corecursion and codata allow total languages to work with infinite data structures.".
- Corecursion wikiPageExternalLink summary?doi=10.1.1.32.5446.
- Corecursion wikiPageExternalLink summary?doi=10.1.1.40.4243.
- Corecursion wikiPageExternalLink 576961.
- Corecursion wikiPageExternalLink HR.
- Corecursion wikiPageExternalLink issue-14.
- Corecursion wikiPageExternalLink corecursion.
- Corecursion wikiPageExternalLink 1989SPE.
- Corecursion wikiPageExternalLink total_functional_programming.
- Corecursion wikiPageExternalLink metadata.epl?mode=synopsis&bookkey=3630257.
- Corecursion wikiPageID "1338683".
- Corecursion wikiPageRevisionID "604456686".
- Corecursion hasPhotoCollection Corecursion.
- Corecursion subject Category:Articles_with_example_Haskell_code.
- Corecursion subject Category:Articles_with_example_Python_code.
- Corecursion subject Category:Category_theory.
- Corecursion subject Category:Functional_programming.
- Corecursion subject Category:Recursion.
- Corecursion subject Category:Self-reference.
- Corecursion subject Category:Theoretical_computer_science.
- Corecursion comment "In computer science, corecursion is a type of operation that is dual to recursion. Whereas recursion works analytically, starting on data further from a base case and breaking it down into smaller data and repeating until one reaches a base case, corecursion works synthetically, starting from a base case and building it up, iteratively producing data further removed from a base case.".
- Corecursion label "Corecursie".
- Corecursion label "Corecursion".
- Corecursion label "Корекурсия".
- Corecursion sameAs Corecursie.
- Corecursion sameAs m.04ty4m.
- Corecursion sameAs Q2524691.
- Corecursion sameAs Q2524691.
- Corecursion wasDerivedFrom Corecursion?oldid=604456686.
- Corecursion isPrimaryTopicOf Corecursion.