A Typed Semantics of Higher-Order Store and Subtyping
نویسنده
چکیده
We consider a call-by-value language, with higher-order functions, records, references to values of arbitrary type, and subtyping. We adapt an intrinsic denotational model for a similar language based on a possible-world semantics, recently given by Levy [14], and relate it to an untyped model by a logical relation. Following the methodology of Reynolds [22], this relation is used to establish coherence of the typed semantics, with a coercion interpretation of subtyping. We obtain a typed denotational semantics of (imperative) object-based languages.
منابع مشابه
Typed operational semantics for higher-order subtyping
Bounded operator abstraction is a language construct relevant to object oriented programming languages and to ML2000, the successor to Standard ML. In this paper, we introduce Fω ≤, a variant of Fω <: with this feature and with Cardelli and Wegner’s kernel Fun rule for quantifiers. We define a typed operational semantics with subtyping and prove that it is equivalent with Fω ≤, using a Kripke m...
متن کاملAnti-Symmetry of Higher-Order Subtyping
This paper shows that the subtyping relation of a higher-order lambda calculus, F ! , is anti-symmetric. It exhibits the rst such proof, establishing in the process that the subtyping relation is a partial order| reeexive, transitive and anti-symmetric. While a sub-typing relation is reeexive and transitive by deeni-tion, anti-symmetry is a derived property. The result, which may seem obvious t...
متن کاملDecidable Higher Order Subtyping
This paper establishes the decidability of typechecking in Fω ∧ , a typed lambda calculus combining higher-order polymorphism, subtyping, and intersection types. It contains the first proof of decidability of subtyping for a higher-order system.
متن کاملTypes, Subtypes, and ASL+
ASL+ is a formalism for speciication and programming in-the-large, based on an arbitrary institution. It has rules for proving the satisfaction and reenement of speciications, which can be seen as a type theory with subtyping, including contravariant reenement for-abstracted speciications and a notion of stratiied equality for higher-order objects. We describe the syntax of the language and a p...
متن کاملMultiple Inheritance via Intersection Types
Combining intersection types with higher-order subtyping yields a typed model of object-oriented programming with multiple inheritance. Objects, message passing, subtyping, and inheritance appear as programming idioms in a typed-calculus, a modelling technique that facilitates experimentation and helps in distinguishing between essential aspects of the object-oriented style |encapsulation and s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005