1. Benanav, D., Kapur, D., Narendran, P.: Complexity of matching problems. J. of Symbolic Computation 3(1-2), 203–216 (1987)
2. Bendix, P., Knuth, D.: Simple word problems in universal algebra. In: Leech, J. (ed.) Computational problems in abstract algebra, Pergamon Press, Oxford (1970)
3. Burton, F., Cameron, R.: Pattern matching with abstract data types. J. of Functional Programming 3(2), 171–190 (1993)
4. Burton, W., et al.: Views: An extension to Haskell pattern matching (1996), http://www.haskell.org/extensions/views.html
5. Research notes in theoretical computer science;P. Chenadec Le,1986