Extending Groovy's reification and closures

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

Abstract

Groovy is a dynamic language that allows the easy modification of its own behaviour. A simple mechanism to introduce changes in the core language is by using Abstract Syntax Tree(AST) transformations. In this paper we describe two new features added to Groovy: the introduction of Reification, and the enhancement of Groovy Closures. In the first extension we make it possible for the user to know the types of a generic class during runtime. In the second one, Groovy closures were improved with the addition of two methods: one to provide closures return type and another to give the closure's source code. © Springer International Publishing Switzerland 2014.

Cite

CITATION STYLE

APA

Cortinhas, C., & Barros, F. (2014). Extending Groovy’s reification and closures. In Advances in Intelligent Systems and Computing (Vol. 276 VOLUME 2, pp. 1–7). Springer Verlag. https://doi.org/10.1007/978-3-319-05948-8_1

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