Anonymous user
Talk:Algebraic data types: Difference between revisions
no edit summary
(suggested splitting the task in two.) |
No edit summary |
||
Line 11:
:There are two mostly distinct basic concepts: pattern matching/destructuring of data structures (which this task is about) and regular-expression-style text matching. There can also be systems which combine features of both; for example, [[:Category:E|E]] allows regular expressions within data-structure patterns, and uses regular-expression-style quantification within term-tree patterns. --[[User:Kevin Reid|Kevin Reid]] 11:19, 7 November 2007 (MST)
How about some test data?
There's also unification - when a variable name appears multiple times in a pattern, it must stand in for the (fsvo) same data in all cases. But pattern-matching is most commonly used in conjunction with languages with Hindley-Milner type checkers and should be understood in terms of these implementations. foobie-bletch 18:02, 6 August 2009 (UTC)
| |||