Jump to content

Pattern calculus

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Barry Jay Sydney (talk | contribs) at 23:54, 6 August 2012. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In mathematical logic, pattern calculus is a formalism that 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).

Stub icon

This formal methods-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Pattern_calculus&oldid=506146298"