A new look at pattern matching in abstract data types

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 31, Issue 6, 1996, Pages 110-121

  Palao Gostanza, Pedro ^a   Peña, Ricardo ^a   Núñez, Manuel ^a  

^a UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0345837439     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/232629.232641     Document Type: Article

References (23)

1. William E. Aitken and John H. Reppy. Abstract data constructors. In Proceedings ACM SIGPLAN Workshop on ML and its Aplications, pages 1-11, 1992.
2. A. W. Appel and D. B. MacQueen. A standard ML compiler. In Functional Programming Languages and Computer Architecture'87, LNCS 274, pages 301-324, 1987.
3. Egidio Astesiano and Maura Cerioli. On the existence of initial models for partial (higher order) conditional specifications. In TAPSOFT'89, LNCS 351, pages 74-88, 1989.
4. Lennard Augutsson. Compiling pattern matching. In Functional Programming Languages and Computer Architecture'85, LNCS 201, pages 368-381, 1985.
5. Emery Berger. FP + OOP = Haskell, 1991.
6. F. Warren Burton and Robert D. Cameron. Pattern matching with abstract data types. Journal of Functional Programming, 3(2):171-190, 1993.
7. Albert Gräf. Left-to-right tree pattern matching. In 4th Rewriting Techniques and Applications, LNCS 488, pages 323-334, 1991.
8. Reinhold Heckmann. A functional language for the specification of complex tree transformation. In ESOP'88, LNCS 300, pages 175-190, 1988.
9. P. Hudak, P. Wadler, Arvind, B. Boutel, J. Fairburn, J. Fasel, K. Hammond, J. Hughes, T. Johnson, D. Kieburtz, R. Nikhil, S. Peyton Jones, M. Reeve, D. Wise, and J. Young. Report on the programming language Haskell: A non-strict purely functional language (version 1.0). Technical Report YALEU/DCS/RR777, Yale University, Deparment of Computer Science, 1990.
10. Paul Hudak, Simon Peyton Jones, and Philip Wadler. Report on the functional programming language Haskell, version 1.2. SIGPLAN Notices, 27(5):1-154, 1992.
11. Alain Laville. Implementation of lazy pattern matching algorithms. In ESOP'88, LNCS 300, pages 298-316, 1988.
12. Luc Maranget. Two techniques for compiling lazy pattern matching. Technical Report RR-2385, INRIA, October 1994.
13. Manuel Núñez, Pedro Palao Gostanza, and Ricardo Peña. A second year course on data structures based on functional programming. In Functional Programming Languages in Education, LNCS 1022, pages 65-84, 1995.
14. Pedro Palao Gostanza. Integración de ajuste de patrones y tipos abstractos de datos. Technical Report DIA-UCM 16/94, Dept. Informática y Automática, Universidad Complutense de Madrid, 1994. In Spanish.
15. Ricardo Peña. Diseño de Programas. Prentice Hall, 1993. In Spanish.
16. Laurence Puel and Ascánder Suárez. Compiling pattern matching by term decomposition. In Proceedings ACM Conference on LISP and Functional Programming, pages 273-281, 1990.
17. Christian Queinnec. Compilation of non-linear, second order patterns on S-expressions. In PLILP'90, LNCS 456, pages 340-357, 1990.
18. John Reppy. A higher-order concurrent language. In Proceedings SIGPLAN'91, pages 294-305, 1991.
19. Simon Thompson. Laws in Miranda. In Proceedings ACM Conference on LISP and Functional Programming, pages 1-12, 1986.
20. Simon Thompson. Lawful functions and program verification in Miranda. Science of Computer Programming, 13(2-3):181-218, 1990.
21. David A. Turner. An overwiew of Miranda. In David A. Turner, editor, Research Topics in Functional Programming. Addison Wesley, 1990.
22. Philip Wadler. Efficient compilation of pattern matching. In S.L. Peyton Jones, editor, The Implementation of Functional Programming Languages, chapter 5. Prentice Hall International, 1987.
23. Philip Wadler. Views: A way for pattern matching to cohabit with data abstraction. In Proceedings 14th Principles of Programming Languages, pages 307-313, 1987.