Properties of Java Simple Closures

Issue title: Concurrency Specification and Programming (CS&P)

Article type: Research Article

Authors: Bellia, Marco | Occhiuto, M. Eugenia

Affiliations: Dipartimento di Informatica, Università di Pisa, Largo B. Pontecorvo, 3, I-56127 Pisa, Italy. bellia@di.unipi.it ; occhiuto@di.unipi.it

Abstract: In the last years, the Java community has been arguing about adding closures to Java in order to improve expressivity. The debate has not yet terminated but all proposals seem to converge towards a notion of Simple Closures which contain only the essential features of anonymous functions. This paper addresses the problem of defining a rigorous semantics for Simple Closures. The technique adopted is well known and has already been used to prove interesting properties of other extensions of Java. A minimal calculus is defined: Featherweight Java extended with Simple Closures. Syntax and semantics of such a calculus are defined and type safety, backward compatibility, and the abstraction property are proved.

DOI: 10.3233/FI-2011-508

Journal: Fundamenta Informaticae, vol. 109, no. 3, pp. 237-253, 2011