Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Anonymous_recursion> ?p ?o }
Showing triples 1 to 45 of
45
with 100 triples per page.
- Anonymous_recursion abstract "In computer science, anonymous recursion is recursion which does not explicitly call a function by name. This can be done either explicitly, by using a higher-order function – passing in a function as an argument and calling it – or implicitly, via reflection features which allow one to access certain functions depending on the current context, especially "the current function" or sometimes "the calling function of the current function".In programming practice, anonymous recursion is notably used in JavaScript, which provides reflection facilities to support it. In general programming practice, however, this is considered poor style, and recursion with named functions is suggested instead. Anonymous recursion via explicitly passing functions as arguments is possible in any language that supports functions as arguments, though this is rarely used in practice, as it is longer and less clear than explicitly recursing by name.In theoretical computer science, anonymous recursion is important, as it shows that one can implement recursion without requiring named functions. This is particularly important for the lambda calculus, which has anonymous unary functions, but is able to compute any recursive function. This anonymous recursion can be produced generically via fixed-point combinators.".
- Anonymous_recursion wikiPageID "3062599".
- Anonymous_recursion wikiPageLength "10275".
- Anonymous_recursion wikiPageOutDegree "31".
- Anonymous_recursion wikiPageRevisionID "628476829".
- Anonymous_recursion wikiPageWikiLink Anonymous_function.
- Anonymous_recursion wikiPageWikiLink Call_stack.
- Anonymous_recursion wikiPageWikiLink Callback_(computer_programming).
- Anonymous_recursion wikiPageWikiLink Category:Recursion.
- Anonymous_recursion wikiPageWikiLink Closure_(computer_programming).
- Anonymous_recursion wikiPageWikiLink Closure_(computer_science).
- Anonymous_recursion wikiPageWikiLink Combinatory_logic.
- Anonymous_recursion wikiPageWikiLink Computer_science.
- Anonymous_recursion wikiPageWikiLink Currying.
- Anonymous_recursion wikiPageWikiLink Direct_recursion.
- Anonymous_recursion wikiPageWikiLink Fixed-point_combinator.
- Anonymous_recursion wikiPageWikiLink Go_(programming_language).
- Anonymous_recursion wikiPageWikiLink Higher-order_function.
- Anonymous_recursion wikiPageWikiLink Indirect_recursion.
- Anonymous_recursion wikiPageWikiLink JavaScript.
- Anonymous_recursion wikiPageWikiLink Lambda_calculus.
- Anonymous_recursion wikiPageWikiLink Mutual_recursion.
- Anonymous_recursion wikiPageWikiLink Name_binding.
- Anonymous_recursion wikiPageWikiLink Object-oriented_programming.
- Anonymous_recursion wikiPageWikiLink Perl.
- Anonymous_recursion wikiPageWikiLink Programming_style.
- Anonymous_recursion wikiPageWikiLink Recursion_(computer_science).
- Anonymous_recursion wikiPageWikiLink Reflection_(computer_programming).
- Anonymous_recursion wikiPageWikiLink Self-reference.
- Anonymous_recursion wikiPageWikiLink This_(computer_programming).
- Anonymous_recursion wikiPageWikiLinkText "Anonymous recursion".
- Anonymous_recursion wikiPageWikiLinkText "anonymous recursion".
- Anonymous_recursion hasPhotoCollection Anonymous_recursion.
- Anonymous_recursion wikiPageUsesTemplate Template:Reflist.
- Anonymous_recursion subject Category:Recursion.
- Anonymous_recursion hypernym Recursion.
- Anonymous_recursion type Algorithm.
- Anonymous_recursion comment "In computer science, anonymous recursion is recursion which does not explicitly call a function by name.".
- Anonymous_recursion label "Anonymous recursion".
- Anonymous_recursion sameAs 無名再帰.
- Anonymous_recursion sameAs m.0117xv3c.
- Anonymous_recursion sameAs Q11567331.
- Anonymous_recursion sameAs Q11567331.
- Anonymous_recursion wasDerivedFrom Anonymous_recursion?oldid=628476829.
- Anonymous_recursion isPrimaryTopicOf Anonymous_recursion.