First class patterns

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1753, Issue , 2000, Pages 1-15

  Tullsen, Mark ^a  

^a Yale University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS;

CLASS PATTERNS; COMBINATORS; DATA ABSTRACTION; HASKELL; LANGUAGE CONSTRUCTS; PATTERN GUARDS; RUN-TIME ERRORS;

PATTERN MATCHING;

EID: 84958980478     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46584-7_1     Document Type: Conference Paper

References (10)

1. William Aitken and John H. Reppy. Abstract value constructors: Symbolic constants for standard ML. Technical Report CORNELLCS//TR92-1290, Cornell University, Computer Science Department, June 1992.
2. F. W. Burton and R. D. Cameron. Pattern matching with abstract data types. Journal of Functional Programming, 3(2):171-190, 1993.
3. Manuel Fähndrich and John Boyland. Statically checkable pattern abstractions. In Proceedings of the 1997 ACM SIGPLAN International Conference on Functional Programming, pages 75-84, Amsterdam, The Netherlands, 9-11 June 1997.
4. P. Hudak, S. P. Jones, and P. Wadler. Report on the programming language Haskell. SIGPLAN Notices, 27(5), May 1992.
5. Graham Hutton and Erik Meijer. Monadic parser combinators. Technical Report NOTTCS-TR-96-4, University of Nottingham, December 1996.
6. John Hughes. Generalizing monads to arrows. Submitted for publication, 1998.
7. Palao Gostanza Pedro, Ricardo Peña, and Manuel Núñez. A new look at pattern matching in abstract data types. In Proceedings of the ACM SIG- PLAN International Conference on Functional Programming (ICFP '96), volume 31(6) of ACM SIGPLAN Notices, pages 110-121. ACM, June 1996.
8. P. L. Wadler. How to replace failure by a list of successes. In Jean-Pierre Jouannaud, editor, Functional Programming Languages and Computer Architecture, volume 201 of Lecture Notes in Computer Science, pages 113-128. Springer Verlag, September 1985.
9. 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.
10. Philip Wadler. Views: A way for pattern-matching to cohabit with data abstraction. In Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, pages 307-313. ACM, January 1987.