JMatch: Iterable abstract pattern matching for Java

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

Volumn 2562, Issue , 2003, Pages 110-127

  Liu, Jed ^a   Myers, Andrew C ^a  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; ALGEBRA; BOOLEAN ALGEBRA; COMPUTATIONAL LINGUISTICS; ITERATIVE METHODS; JAVA PROGRAMMING LANGUAGE; PATTERN MATCHING;

BOOLEAN FORMULAE; DATA ABSTRACTION; DEEP PATTERNS; ITERABLE;

ABSTRACT DATA TYPES;

EID: 35248855960     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36388-2_9     Document Type: Article

References (31)

1. Krzysztof R. Apt, Jacob Brunekreef, Vincent Partington, and Andrea Schaerf. Alma-0: An imperative language that supports declarative programming. ACM Transactions on Programming Languages and Systems, 20(5):1014-1066, September 1998.
2. F. W. Burton and R. D. Cameron. Pattern matching with abstract data types. Journal of Functional Programming, 3(2): 171-190, 1993.
3. K. Claessen and P. Ljungl. Typed logical variables in Haskell. In Haskell Workshop 2000, 2000.
4. Thomas A. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms. MIT Press, 1990.
5. Melvin E. Conway. Design of a separable transition-diagram compiler. Communications of the ACM, 6(7):396-408, 1963.
6. Michael Ernst, Craig Kaplan, and Craig Chambers. Predicate dispatching: A unified theory of dispatch. In 12th European Conference on Object-Oriented Programming, pages 186-211, Brussels, Belgium, July 1998.
7. Manuel Fähndrich and John Boyland. Statically checkable pattern abstractions. In Proc. 2nd ACM SIGPLAN International Conference on Functional Programming (ICFP), pages 75-84, June 1997.
8. Remi Forax and Gilles Roussel. Recursive types and pattern matching in Java. In Proc. International Symposium on Generative and Component-Based Software Engineering (GCSE '99), Erfurt, Germany, September 1999. LNCS 1799.
9. Ralph E. Griswold, David R. Hanson, and John T. Korb. Generators in ICON. ACM Transaction on Programming Languages and Systems, 3(2), April 1981.
10. James Gosling, Bill Joy, and Guy Steele. The Java Language Specification. Addison-Wesley, August 1996. ISBN 0-201-63451-1.
11. Steven Gregory. Parallel Programming in PARLOG. Addison-Wesley, 1987.
12. Michael Hanus. A unified computation model for functional and logic programming. In Proc. 24th ACM Symp. on Principles of Programming Languages (POPL), pages 80-93, Paris, France, January 1997.
13. C. T. Haynes, D. P. Friedman, and M. Wand. Obtaining coroutines from continuations. Journal of Computer Languages, 11(3-4):143-153, 1986.
14. Paul Hudak, Simon Peyton Jones, and Philip Wadler. Report on the programming language Haskell. SIGPLAN Notices, 27(5), May 1992.
15. Trevor Jim, Greg Morrisett, Dan Grossman, Michael Hicks, James Cheney, and Yanling Wang. Cyclone: A safe dialect of C. In Proceedings of the USENIX Annual Technical Conference, pages 275-288, Monterey, CA, June 2002. See also http://www.cs.cornell.edu/projects/cyclone.
16. Haskell 98: A non-strict, purely functional language, February 1999. Available at http://www.haskell.org/onlinereport/.
17. B. Liskov et al. CLU reference manual. In Goos and Hartmanis, editors, Lecture Notes in Computer Science, volume 114. Springer-Verlag, Berlin, 1981.
18. John W. Lloyd. Programming in an integrated functional and logic programming language. Journal of Functional and Logic Programming, 3, March 1999.
19. Jed Liu and Andrew C. Myers. JMatch: Java plus pattern matching. Technical Report TR2002-1878, Computer Science Department, Cornell University, October2002. Software release at http://www.cs.cornell.edu/projects/jmatch.
20. Microsoft Corporation. Microsoft C# Language Specifications. Microsoft Press, 2001. ISBN 0-7356-1448-2.
21. Stephan Murer, Stephen Omohundro, David Stoutamire, and Clemens Szyperski. Iteration abstraction in Sather. ACM Transactions on Programming Languages and Systems, 18(1):1-15, January 1996.
22. Robin Milner, Mads Tofte, and Robert Harper. The Definition of Standard ML. MIT Press, Cambridge, MA, 1990.
23. Nathaniel Nystrom, Michael Clarkson, and Andrew C. Myers. Polyglot: An extensible compiler framework for Java. Technical Report 2002-1883, Computer Science Dept., Cornell University, 2002.
24. Greg Nelson, editor. Systems Programming with Modula-3. Prentice-Hall, 1991.
25. Chris Okasaki. Purely Functional Data Structures. Cambridge University Press, 1998. ISBN 0-521-63124-6.
26. Chris Okasaki. Views for Standard ML. In Workshop on ML, pages 14-23, September 1998.
27. Martin Odersky and Philip Wadler. Pizza into Java: Translating theory into practice. In Proc. 24th ACM Symp. on Principles of Programming Languages (POPL), pages 146-159, Paris, France, January 1997.
28. Pedro Palao Gostanza, Ricardo Pena, and Manuel Núñez. A new look at pattern matching in abstract data types. In Proc. 1st ACM SIGPLAN International Conference on Functional Programming (ICFP), Philadelphia, PA, USA, June 1996.
29. Zoltan Somogyi, Fergus Henderson, and Thomas Conway. The execution algorithm of Mercury: an efficient purely declarative logic programming language. Journal of Logic Programming, 29(1-3):17-64, October-December 1996.
30. Mark Tullsen. First-class patterns. In Proc. Practical Aspects of Declarative Languages, 2nd International Workshop (PADL), pages 1-15, 2000.
31. Philip Wadler. Views: A way for pattern matching to cohabit with data abstraction. In Proceedings, 14th Symposium on Principles of Programming Languages, pages 307-312. Association for Computing Machinery, 1987.