Featherweight Java: a minimal core calculus for Java and GJ
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Study on Transformational Semantics
Program Construction, International Summer Schoo
Source-to-source translation: Ada to Pascal and Pascal to Ada
SIGPLAN '80 Proceedings of the ACM-SIGPLAN symposium on The ADA programming language
Properties of Java Simple Closures
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Java SAM Typed Closures: A Sound and Complete Type Inference System for Nominal Types
Fundamenta Informaticae - Concurrency, Specification and Programming
| Hi-index | 0.00 |
FGCJ is a minimal core calculus that extends Featherweight Generic Java, FGJ, with lambda expressions for Java Simple Closures. It has been introduced to study, in a reduction semantics framework, properties of Java Simple Closures, including type safety and abstraction property. ℱ 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, in a translation semantics framework, the design and the implementation features of lambda expressions, including simple closures, this transparency, not local variables and relations with anonymous class objects. In this paper we prove that the reduction semantics and the translation semantics commute in FGACJ. Where FGACJ is a minimal core calculus that extends FGCJ, by adding Java interfaces and anonymous class objects and that allows a restricted definition of translation semantics ℱ.