Featherweight Java

Featherweight Java: A minimal core calculus for Java and GJ. Several recent studies have introduced lightweight versions of Java: reduced languages in which complex features like threads and reflection are dropped to enable rigorous arguments about key properties such as type safety. We carry this process a step further, omitting almost all features of the full language (including interfaces and even assignment) to obtain a small calculus, Featherweight Java, for which rigorous proofs are not only possible but easy. Featherweight Java bears a similar relation to Java as the lambda-calculus does to languages such as ML and Haskell. It offers a similar computational ”feel,” providing classes, methods, fields, inheritance, and dynamic typecasts with a semantics closely following Java’s. A proof of type safety for Featherweight Java thus illustrates many of the interesting features of a safety proof for the full language, while remaining pleasingly compact. The minimal syntax, typing rules, and operational semantics of Featherweight Java make it a handy tool for studying the consequences of extensions and variations. As an illustration of its utility in this regard, we extend Featherweight Java with generic classes in the style of GJ (Bracha, Odersky, Stoutamire, and Wadler) and give a detailed proof of type safety. The extended system formalizes for the first time some of the key features of GJ.

References in zbMATH (referenced in 91 articles )

Showing results 1 to 20 of 91.
Sorted by year (citations)

1 2 3 4 5 next

  1. Audrito, Giorgio; Beal, Jacob; Damiani, Ferruccio; Pianini, Danilo; Viroli, Mirko: Field-based coordination with the share operator (2020)
  2. Karachalias, Georgios; Pretnar, Matija; Saleh, Amr Hany; Vanderhallen, Stien; Schrijvers, Tom: Explicit effect subtyping (2020)
  3. Zhuo, Xilong; Zhang, Chenyi: TFA: an efficient and precise virtual method call resolution for Java (2020)
  4. Dagnino, Francesco: Coaxioms: flexible coinductive definitions by inference systems (2019)
  5. Giannini, Paola; Servetto, Marco; Zucca, Elena; Cone, James: Flexible recovery of uniqueness and immutability (2019)
  6. Haller, Philipp; Miller, Heather: A reduction semantics for direct-style asynchronous observables (2019)
  7. Viroli, Mirko; Beal, Jacob; Damiani, Ferruccio; Audrito, Giorgio; Casadei, Roberto; Pianini, Danilo: From distributed coordination to field calculus and aggregate computing (2019)
  8. Bessai, Jan; Chen, Tzu-Chun; Dudenhefner, Andrej; Düdder, Boris; De’liguoro, Ugo; Rehof, Jakob: Mixin composition synthesis based on intersection types (2018)
  9. Bettini, Lorenzo; Bono, Viviana; Dezani-Ciancaglini, Mariangiola; Giannini, Paola; Venneri, Betti: Java & lambda: a featherweight story (2018)
  10. Damiani, Ferruccio; Padovani, Luca; Schaefer, Ina; Seidl, Christoph: A core calculus for dynamic delta-oriented programming (2018)
  11. Hainry, Emmanuel; Péchoux, Romain: A type-based complexity analysis of object oriented programs (2018)
  12. Olarte, Carlos; Pimentel, Elaine; Rueda, Camilo: A concurrent constraint programming interpretation of access permissions (2018)
  13. Ancona, Davide; Dagnino, Francesco; Zucca, Elena: Generalizing inference systems by coaxioms (2017)
  14. Giannini, Paola; Shaqiri, Albert: A provably correct compilation of functional languages into scripting languages (2017)
  15. Henrio, Ludovic; Rochas, Justine: Multiactive objects and their applications (2017)
  16. Hou (Favonia), Kuen-Bang; Benton, Nick; Harper, Robert: Correctness of compiling polymorphism to dynamic typing (2017)
  17. Jeannin, Jean-Baptiste; Kozen, Dexter; Silva, Alexandra: CoCaml: functional programming with regular coinductive types (2017)
  18. Leinberger, Martin; Lämmel, Ralf; Staab, Steffen: The essence of functional programming on semantic data (2017)
  19. Bettini, Lorenzo: Implementing type systems for the IDE with Xsemantics (2016)
  20. Capriccioli, Andrea; Servetto, Marco; Zucca, Elena: An imperative pure calculus (2016)

1 2 3 4 5 next