Typed Operational Semantics for Dependent Record Types
نویسندگان
چکیده
منابع مشابه
Typed Operational Semantics for Dependent Record Types
H. Goguen [Gog94, Gog99] has developed a method called typed operational semantics (TOS for short) to prove meta-theoretic properties of type theories, including strong normalisation, Church-Rosser and subject reduction. In this paper, using the TOS approach, we study the meta-theoretic properties of a type system with dependent record types. A record type is a type of labelled tuples called re...
متن کاملTyped Operational Semantics for Higher
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 quantiiers. We deene a typed operational semantics with subtyp-ing and prove that it is equivalent with F ! , using a Kripke m...
متن کامل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...
متن کاملGame Semantics for Dependent Types
In [1], we presented a game semantics for dependent type theory (DTT), which we shall recall. It a model of DTT with Π-, 1-, Σand intensional Id-types, which is based on a slight variation of the (call-by-name) category of AJM-games and history-free winning well-bracketed strategies. The model satisfies Streicher’s criteria of intensionality and refutes function extensionality. The principle of...
متن کاملDependent Record Types
iii Abstract This work contains investigations on the formal correctness and use of an extension of Martin-L of's type theory with dependent record types and subtyping. We put forward the adequacy of dependent record types as a natural type theoretic setting for expressing the notion of abstract data type | in particular we explore the formal representation of systems of algebras | and for the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2011
ISSN: 2075-2180
DOI: 10.4204/eptcs.53.3