Pattern calculus
 | This article includes a list of general references, but it lacks sufficient corresponding inline citations. (November 2016) |
Pattern calculus bases all computation on pattern matching of a very general kind. Like lambda calculus, it supports a
uniform treatment of function evaluation. Also, it allows functions to be
passed as arguments and returned as results. In addition, pattern calculus supports
uniform access to the internal structure of arguments, be they pairs
or lists or trees. Also, it allows patterns to be passed as arguments and
returned as results. Uniform access is illustrated by a
pattern-matching function size that computes the size of an
arbitrary data structure. In the notation of the programming language
bondi, it is given by the recursive function
let rec size =
| x y -> (size x) + (size y)
| x -> 1
The second, or default case x -> 1 matches the pattern x
against the argument and returns 1. This
case is used only if the matching failed in the first case. The
first, or special case matches against any compound, such
as a non-empty list, or pair. Matching binds x to the left component
and y to the right component. Then the body of the case adds the
sizes 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 creating
the leaves of a tree, and Count for converting numbers into
counters. The corresponding eliminators are then
elimLeaf = | Leaf y -> y
elimCount = | Count y -> y
For example, elimLeaf (Leaf 3) evaluates to 3 as does elimCount (Count 3).
These examples can be produced by applying the generic eliminator
elim to the constructors in question. It is defined by
elim = | x -> | {y} x y -> y
Now 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 the
pattern, so that x is free and y is bound in | {y} x y -> y.
External links
[edit]- Archive mirror of the links below (which are no longer online)
- Jay, C. Barry (November 2004). "The pattern calculus". ACM Trans. Program. Lang. Syst. 26 (6): 911–937. doi:10.1145/1034774.1034775. S2CID 14252624. — the original paper, but not most general.
- Jay, B.; Kesner, D. (2006). "Pure Pattern Calculus". In Sestoft, P. (ed.). Programming Languages and Systems. ESOP 2006. Lecture Notes in Computer Science. Vol. 3924. Springer. pp. 100–114. doi:10.1007/11693024_8. hdl:10453/1684. ISBN 978-3-540-33096-7.
- Jay, Barry (2009). Pattern Calculus: Computing with Functions and Structures. Springer. doi:10.1007/978-3-540-89185-7. ISBN 978-3-540-89185-7.
- bondi programming language research site
- Given-Wilson, T.; Gorla, D.; Jay, B. (2010). "Concurrent Pattern Calculus". In Calude, C.S.; Sassone, V. (eds.). Theoretical Computer Science. TCS 2010. IFIP Advances in Information and Communication Technology. Vol. 323. Springer. doi:10.1007/978-3-642-15240-5_18. ISBN 978-3-642-15240-5.