Views: A way for pattern matching to Cohabit with data abstraction

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn Part F130236, Issue , 1987, Pages 307-313

  Wadler, Philip ^a,b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING;

DATA ABSTRACTION; DATA TYPE;

PATTERN MATCHING;

EID: 84944082436     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/41625.41653     Document Type: Conference Paper

References (17)

1. L. Augustsson. A compiler for lasy ML. In Proceedings of the 1984 ACM Symposium on Lisp and Functional Programming, pages 218-227, Austin, 1984,
2. L. Augustsson. Compiling pattern matching. In Proceedings of the Conference on Functional Programming Languages and Computer Architecture, Springer-Verlag, September 1985.
3. R. M. Burstall and J. Darlington. A transformation system for developing recursive programs. Journal of the ACM, 24(1):44-67, January 1977.
4. R. S. Bird. An introduction to the theory of lists. In Marktoberdorf Workshop on Logics of Programming, August 1986.
5. R. Burstall, D. MacQueen, and D. Sanella. Hope: An experimental applicative language. Technical Report Report CSR-62-80, Edinburgh University, Computer Science Dept., 1980.
6. R. M. Burstall. Proving properties of programs by structural induction. The Computer Journal, 12(1), February 1969.
7. K. Futasagi, J. A. Goguen, J.-P. Jouannaud, and J. Meseguer. Principles of OBJ2. In ACM Symposium on Principles of Programming Languages, pages 52-66, January 1985.
8. J. Fairbairn and S. C. Wray. Code generation techniques for functional languages. In Proceedings of the 1986 ACM Symposium on Lisp and Functional Programming, pages 94-104, Boston, 1986.
9. P. Hudak and D. Krans. A combinator-based compiler for a functional language. In ACM Symposium on Principles of Programming Languages, pages 121-132, January 1984.
10. T. Johnsson. Lambda lifting: transforming programs to recursive equations. In Proceedings 1985 Conference on Functional Programming Languages and Computer Architecture, Nancy, France, 1985.
11. L. Meertens. Algorithmcs: Towards programming as a mathematical activity. In J. W. de Bakker, et al., editors, Mathematics and Computer Science, North-Holland, 1984.
12. S. L. Peyton-Jones. Implementing Functional Languages using Graph Reduction. Prentice-Hall, 1987.
13. M. R. Sleep and S. Holmström. A short note concerning laxy reduction rules of append. Software Practice and Experience, 12(11):1082-4, November 1982.
14. S. Thompson. Laws in miranda. In ACM Symposium on Lisp and Functional Programming, pages 1-12, August 1986.
15. D. A. Turner. Recursion equations as a programming language. In J. Darlington, P. Henderson, and D. Turner, editors, Functional Programming and Its Applications, Cambridge University Press, 1981.
16. D. A. Turner. Miranda: A non-strict functional language with polymorphic types. In Proceedings of the Conference on Functional Programming Languages and Computer Architecture, Springer-Verlag, September 1985.
17. P. L. Wadler. Compiling pattern matching; List comprehensions. In [Pey87].