Subtyping object and recursive types logically

Authors:
Steffen van Bakel;Ugo de’Liguoro
Affiliations:
Department of Computing, Imperial College, London, UK;Dipartimento di Informatica, Università di Torino, Torino, Italy
Venue:
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Year:
2005

Citing 8
Cited 0

A modest model of records, inheritance, and unbounded quantification

Information and Computation - Selections from 1988 IEEE symposium on logic in computer science
Inheritance as implicit coercion

Information and Computation
PER models of subtyping, recursive types and higher-order polymorphism

POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Intersection type assignment systems

Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
Bisimilarity for a first-order calculus of objects with subtyping

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Foundations of programming languages

Foundations of programming languages
A Theory of Objects

A Theory of Objects
Characterizing convergent terms in object calculi via intersection types

TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications

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 formalized through an assignment system. It is shown that equality in the full first order ς-calculus is modelled by this notion, which on turn is included in a Morris style contextual equivalence.