Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Pattern_calculus> ?p ?o. }
Showing items 1 to 18 of
18
with 100 items per page.
- Pattern_calculus abstract "Pattern calculus bases all computation on pattern matching of a very general kind. Like lambda calculus, it supports auniform treatment of function evaluation. Also, it allows functions to bepassed as arguments and returned as results. In addition, pattern calculus supportsuniform access to the internal structure of arguments, be they pairsor lists or trees. Also, it allows patterns to be passed as arguments andreturned as results. Uniform access is illustrated by apattern-matching function size that computes the size of anarbitrary data structure. In the notation of the programming languagebondi, it is given by the recursive functionThe second, or default case x -> 1 matches the pattern xagainst the argument and returns 1. Thiscase is used only if the matching failed in the first case. Thefirst, or special case matches against any compound, suchas a non-empty list, or pair. Matching binds x to the left componentand y to the right component. Then the body of the case adds thesizes of these components together. Similar techniques yield generic queries for searching and updating. Combining recursion and decomposition in this way yields path polymorphism. The ability to pass patterns as parameters (pattern polymorphism) is illustrated by defining a generic eliminator. Suppose given constructors Leaf for creatingthe leaves of a tree, and </tt>Count</tt> for converting numbers intocounters. The corresponding eliminators are thenFor example, elimLeaf (Leaf 3) evaluates to 3 as does elimCount (Count 3).These examples can be produced by applying the generic eliminatorelim to the constructors in question. It is defined byNow elim Leaf evaluates to | {y} Leaf y -> y which is equivalent to elimLeaf. Also elim Count is equivalent to elimCount. In general, the curly braces {} contain the bound variables of thepattern, so that x is free and y is bound in | {y} x y -> y.".
- Pattern_calculus wikiPageExternalLink bondi.it.uts.edu.au.
- Pattern_calculus wikiPageExternalLink citation.cfm?id=1034775.
- Pattern_calculus wikiPageExternalLink repo_A45US65o.
- Pattern_calculus wikiPageExternalLink 1.
- Pattern_calculus wikiPageExternalLink 978-3-540-89184-0.
- Pattern_calculus wikiPageExternalLink 403wp875t868h3m2.
- Pattern_calculus wikiPageID "30643952".
- Pattern_calculus wikiPageRevisionID "591365583".
- Pattern_calculus hasPhotoCollection Pattern_calculus.
- Pattern_calculus subject Category:Lambda_calculus.
- Pattern_calculus comment "Pattern calculus bases all computation on pattern matching of a very general kind. Like lambda calculus, it supports auniform treatment of function evaluation. Also, it allows functions to bepassed as arguments and returned as results. In addition, pattern calculus supportsuniform access to the internal structure of arguments, be they pairsor lists or trees. Also, it allows patterns to be passed as arguments andreturned as results.".
- Pattern_calculus label "Pattern calculus".
- Pattern_calculus sameAs m.0g9ym9j.
- Pattern_calculus sameAs Q7148373.
- Pattern_calculus sameAs Q7148373.
- Pattern_calculus wasDerivedFrom Pattern_calculus?oldid=591365583.
- Pattern_calculus isPrimaryTopicOf Pattern_calculus.