JMatch: Java plus Pattern Matching
| dc.contributor.author | Liu, Jed | en_US |
| dc.contributor.author | Myers, Andrew C. | en_US |
| dc.date.accessioned | 2007-04-09T19:57:43Z | |
| dc.date.available | 2007-04-09T19:57:43Z | |
| dc.date.issued | 2002-10-18 | en_US |
| dc.description.abstract | The JMatch language extends Java with \emph{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. (updated April 20, 2005). | en_US |
| dc.format.extent | 266185 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR2002-1878 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/5854 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | JMatch: Java plus Pattern Matching | en_US |
| dc.type | technical report | en_US |
Files
Original bundle
1 - 1 of 1