Logical Equivalence for Subtyping Object and Recursive Types

Authors:
Steffen van Bakel;Ugo de’Liguoro
Affiliations:
Imperial College, Department of Computing, 180 Queen’s Gate, SW7 2BZ, London, UK;Università di Torino, Dipartimento di Informatica, Corso Svizzera 185, 10149, Torino, Italy
Venue:
Theory of Computing Systems
Year:
2008

Citing 0
Cited 4

Semantic predicate types and approximation for class-based object oriented programming

Proceedings of the 11th International Workshop on Formal Techniques for Java-like Programs
Approximation semantics and expressive predicate assignment for object-oriented programming

TLCA'11 Proceedings of the 10th international conference on Typed lambda calculi and applications
Semantic Types and Approximation for Featherweight Java

Theoretical Computer Science
Completeness and Soundness Results for X with Intersection and Union Types

Fundamenta Informaticae - Intersection Types and Related Systems ITRS

Quantified Score

Hi-index	0.00

Visualization

Abstract

Subtyping in first order object calculi is studied with respect to the logical semantics obtained by identifying terms that satisfy the same set of predicates, as formalised through an assignment system. It is shown that equality in the full first order ς-calculus is modelled by this notion, which in turn is included in a Morris-style contextual equivalence.