A reduction semantics for imperative higher-order languages
Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Functional programming and lambda calculus
Handbook of theoretical computer science (vol. B)
Pizza into Java: translating theory into practice
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Making the future safe for the past: adding genericity to the Java programming language
Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Featherweight Java: a minimal core calculus for Java and GJ
Proceedings of the 14th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Featherweight Java: a minimal core calculus for Java and GJ
ACM Transactions on Programming Languages and Systems (TOPLAS)
Design Patterns CD: Elements of Reusable Object-Oriented Software, (CD-ROM)
Design Patterns CD: Elements of Reusable Object-Oriented Software, (CD-ROM)
Information and Computation - FOOL VII
Higher order Programming in Java: Introspection, Subsumption and Extraction
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Higher-order functional programming and wildcards in java
ACM-SE 45 Proceedings of the 45th annual southeast regional conference
Methods as Parameters: A Preprocessing Approach to Higher Order in Java
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Java as a functional programming language
TYPES'02 Proceedings of the 2002 international conference on Types for proofs and programs
The Equivalence of Reduction and Translation Semantics of Java Simple Closures
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
| Hi-index | 0.00 |
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.