JMatch: Iterable Abstract Pattern Matching for Java

  • Jed Liu
  • Andrew C. Myers
Conference paper

DOI: 10.1007/3-540-36388-2_9

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2562)
Cite this paper as:
Liu J., Myers A.C. (2003) JMatch: Iterable Abstract Pattern Matching for Java. In: Dahl V., Wadler P. (eds) Practical Aspects of Declarative Languages. PADL 2003. Lecture Notes in Computer Science, vol 2562. Springer, Berlin, Heidelberg

Abstract

The JMatch language extends Java with iterable abstract pattern matching, pattern matching that is compatible with the data abstraction features of Java and makes iteration abstractions convenient. JMatch has ML-style deep pattern matching, but patterns can be abstract; they are not tied to algebraic data constructors.A single JMatch method may be used in several modes; modes may share a single implementation as a boolean formula. Modal abstraction simplifies specification and implementation of abstract data types. This paper describes the JMatch language and its implementation.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Jed Liu
    • 1
  • Andrew C. Myers
    • 1
  1. 1.Computer Science DepartmentCornell UniversityIthaca NewYork

Personalised recommendations