# Proving Translation and Reduction Semantics Equivalent for Java Simple Closures: Extended Version

Bellia, Marco and Occhiuto, Maria Eugena (2011) Proving Translation and Reduction Semantics Equivalent for Java Simple Closures: Extended Version. Technical Report del Dipartimento di Informatica . Università di Pisa, Pisa, IT.

 Other (GZip) Available under License Creative Commons Attribution No Derivatives. Download (317Kb)

## Abstract

\Lname\ is a minimal core calculus that extends Featherweight (generic) Java, \FGJ, with lambda expressions. It has been used to study properties of Simple Closure in Java, including type safety and the abstraction property. Its formalization is based on a reduction semantics and a typing system that extend those of \FGJ. ${\cal F}$ is a source-to-source, translation rule system from Java 1.5 extended with lambda expressions back to ordinary Java 1.5. It has been introduced to study implementation features of closures in Java, including assignment of non local variables and relations with anonymous class objects. In this paper we prove that the two semantics commute. <br /><br />

Item Type: Book Higher Order, OO programming, Java, Closures, Reduction Semantics, Translation Semantics, Semantic Equivalence Area01 - Scienze matematiche e informatiche > INF/01 - Informatica Dipartimenti (until 2012) > DIPARTIMENTO DI INFORMATICA dott.ssa Sandra Faita 03 Dec 2014 18:23 03 Dec 2014 18:23 http://eprints.adm.unipi.it/id/eprint/2281

### Repository staff only actions

 View Item