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 68 articles )

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

1 2 3 4 next

  1. Hou (Favonia), Kuen-Bang; Benton, Nick; Harper, Robert: Correctness of compiling polymorphism to dynamic typing (2017)
  2. Jeannin, Jean-Baptiste; Kozen, Dexter; Silva, Alexandra: CoCaml: functional programming with regular coinductive types (2017)
  3. Leinberger, Martin; Lämmel, Ralf; Staab, Steffen: The essence of functional programming on semantic data (2017)
  4. Bettini, Lorenzo: Implementing type systems for the IDE with Xsemantics (2016)
  5. Capriccioli, Andrea; Servetto, Marco; Zucca, Elena: An imperative pure calculus (2016)
  6. Feitosa, Samuel S.; Vizzotto, Juliana K.; Piveta, Eduardo K.; Du Bois, Andre R.: FJQuantum. A quantum object oriented language (2016)
  7. Pun, Ka I; Steffen, Martin; Stolz, Volker: Effect-polymorphic behaviour inference for deadlock checking (2016)
  8. Raad, Azalea; Santos, José Fragoso; Gardner, Philippa: DOM: specification and client reasoning (2016)
  9. Toninho, Bernardo; Yoshida, Nobuko: Certifying data in multiparty session types (2016)
  10. von Rhein, Alexander; Thüm, Thomas; Schaefer, Ina; Liebig, Jörg; Apel, Sven: Variability encoding: from compile-time to load-time variability (2016)
  11. Basile, Davide; Galletta, Letterio; Mezzetti, Gianluca: Safe adaptation through implicit effect coercion (2015)
  12. Damiani, Ferruccio; Viroli, Mirko: Type-based self-stabilisation for computational fields (2015)
  13. Dovland, Johan; Johnsen, Einar Broch; Owe, Olaf; Yu, Ingrid Chieh: A proof system for adaptable class hierarchies (2015)
  14. Tan, Gang: JNI light: an operational model for the core JNI (2015)
  15. AbdelGawad, Moez A.: A domain-theoretic model of nominally-typed object-oriented programming (2014)
  16. Choi, Kwanghoon; Chang, Byeong-Mo: A type and effect system for activation flow of components in Android programs (2014)
  17. Damiani, Ferruccio; Dovland, Johan; Broch Johnsen, Einar; Schaefer, Ina: Verifying traits: an incremental proof system for fine-grained reuse (2014)
  18. Rowe, Reuben N.S.; van Bakel, S.J.: Semantic types and approximation for Featherweight Java (2014)
  19. Van Cutsem, Tom; Gonzalez Boix, Elisa; Scholliers, Christophe; Lombide Carreton, Andoni; Harnie, Dries; Pinte, Kevin; De Meuter, Wolfgang: Ambienttalk: programming responsive mobile peer-to-peer applications with actors (2014) ioport
  20. Beringer, Lennart; Grabowski, Robert; Hofmann, Martin: Verifying pointer and string analyses with region type systems (2013)

1 2 3 4 next