Semantic types and approximation for Featherweight Java

DOI10.1016/j.tcs.2013.08.017zbMath1358.68180OpenAlexW2087707390MaRDI QIDQ387991

Reuben N. S. Rowe, S. J. van Bakel

Publication date: 18 December 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.08.017

zbMATH Keywords

intersection typesapproximation semanticsderivation reductionFeatherweight Javastrong normalisation

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Semantics in the theory of computing (68Q55)

Related Items (1)

Unnamed Item

Uses Software

• ML
• Haskell
• Python
• Featherweight Java
• Ruby

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cut-elimination in the strict intersection type assignment system is strongly normalizing
• Completeness and partial soundness results for intersection and union typing for \(\overline{\lambda}\mu\tilde{\mu}\)
• The lambda calculus. Its syntax and semantics. Rev. ed.
• The heart of intersection type assignment: Normalisation proofs revisited
• Principal type scheme and unification for intersection type discipline
• An extension of basic functionality theory for \(\lambda\)-calculus
• Complete restrictions of the intersection type discipline
• Intersection type assignment systems
• Normalization results for typeable rewrite systems
• Normalization, approximation, and semantics for combinator systems
• Comparing object encodings.
• Efficient inference of object types
• Logical equivalence for subtyping object and recursive types
• Strict intersection types for the Lambda Calculus
• The duality of computation
• Approximation Semantics and Expressive Predicate Assignment for Object-Oriented Programming
• A filter lambda model and the completeness of type assignment
• Operations on records
• Computation with classical sequents
• Functional Characters of Solvable Terms
• The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
• Approximate Reduction and Lambda Calculus Models
• Modular control-flow analysis with rank 2 intersection types
• A paradigmatic object-oriented programming language: Design, static typing and semantics
• Completeness and Soundness Results for 𝒳 with Intersection and Union Types
• A delegation-based object calculus with subtyping
• Programming Languages and Systems
• Intensional interpretations of functionals of finite type I
• The Principal Type-Scheme of an Object in Combinatory Logic

This page was built for publication: Semantic types and approximation for Featherweight Java