Semantic types and approximation for Featherweight Java (Q387991)

From MaRDI portal

Jump to:navigation, search

scientific article

In more languages

Language	Label	Description	Also known as
English	Semantic types and approximation for Featherweight Java	scientific article

Statements

scholarly article

Semantic types and approximation for Featherweight Java (English)

Reuben N. S. Rowe

S. J. van Bakel

Theoretical Computer Science

publication date

18 December 2013

zbMATH Keywords

Featherweight Java

intersection types

approximation semantics

derivation reduction

strong normalisation

describes a project that uses

Featherweight Java

MaRDI profile type

MaRDI publication profile

full work available at URL

https://doi.org/10.1016/j.tcs.2013.08.017

Complete restrictions of the intersection type discipline

Intersection type assignment systems

Cut-elimination in the strict intersection type assignment system is strongly normalizing

The heart of intersection type assignment: Normalisation proofs revisited

Completeness and partial soundness results for intersection and union typing for \(\overline{\lambda}\mu\tilde{\mu}\)

Strict intersection types for the Lambda Calculus

Completeness and Soundness Results for 𝒳 with Intersection and Union Types

Logical equivalence for subtyping object and recursive types

Normalization results for typeable rewrite systems

Normalization, approximation, and semantics for combinator systems

Computation with classical sequents

Modular control-flow analysis with rank 2 intersection types

The lambda calculus. Its syntax and semantics. Rev. ed.

A filter lambda model and the completeness of type assignment

A paradigmatic object-oriented programming language: Design, static typing and semantics

Comparing object encodings.

Operations on records

An extension of basic functionality theory for \(\lambda\)-calculus

Functional Characters of Solvable Terms

The duality of computation

A delegation-based object calculus with subtyping

The Principal Type-Scheme of an Object in Combinatory Logic

Programming Languages and Systems

Efficient inference of object types

Principal type scheme and unification for intersection type discipline

Approximation Semantics and Expressive Predicate Assignment for Object-Oriented Programming

Intensional interpretations of functionals of finite type I

The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus

Approximate Reduction and Lambda Calculus Models

Identifiers

zbMATH Open document ID

Mathematics Subject Classification ID

zbMATH DE Number

10.1016/J.TCS.2013.08.017

Sitelinks

Mathematics(1 entry)

mardi Publication:387991

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q387991&oldid=38328817"