Recursive types and pattern-matching in java

4Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Recursive types definitions and pattern-matching are two useful built-in features of functional languages. There is no such mechanism in the Java language. In this article, we investigate different implementations to support these features in Java. First, we review methods to define recursive types. Then, we expose several approaches allowing to simulate pattern-matching on structures of these types. Finally, we present re-use techniques for algorithms featuring this mechanism.

Cite

CITATION STYLE

APA

Forax, R., & Roussel, G. (2000). Recursive types and pattern-matching in java. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1799, pp. 147–164). Springer Verlag. https://doi.org/10.1007/3-540-40048-6_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free