JMatch: Iterable abstract pattern matching for Java. (English) Zbl 1026.68795
Dahl, Veronica (ed.) et al., Practical aspects of declarative languages. 5th international symposium, PADL 2003, New Orleans, LA, USA, January 13-14, 2003. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2562, 110-127 (2002).
Summary: 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.
For the entire collection see [Zbl 1014.68932].
For the entire collection see [Zbl 1014.68932].
MSC:
| 68U99 | Computing methodologies and applications |
| 68N15 | Theory of programming languages |
| 68N19 | Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) |
