next up previous contents
Next: Constructions with matching Up: The Righteous syntax Previous: T-uples and lists

Irrefutable patterns

There is a notion of ``irrefutable patterns'' used by some syntactic constructions. Matching against these patterns never fails. An ``irrefutable pattern'' is either:

Note that the term ``irrefutable'' does not apply to all patterns which never fail: constructors alone in their type declarations, except ``()'', are not said ``irrefutable''.



Daniel de Rauglaudre
9/1/1998