Jump to content

Pattern calculus

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Clayrat (talk | contribs) at 22:56, 26 January 2011 (Created page with ''''Pattern calculus''' is a formalism which extends lambda calculus with abilities to match patterns against an arbitrary compound data structure (''path polymo...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Pattern calculus is a formalism which extends lambda calculus with abilities to match patterns against an arbitrary compound data structure (path polymorphism) and to include free variables in patterns (pattern polymorphism).