Subtyping can have a simple semantics


Balsters, Herman and Fokkinga, Maarten M. (1991) Subtyping can have a simple semantics. Theoretical computer science, 87 (1). pp. 81-96. ISSN 0304-3975

open access
PDF - Published Version
Abstract:Consider a first order typed language, with semantics $S$ for expressions and types. Adding subtyping means that a partial order $<$; on types is defined and that the typing rules are extended to the effect that expression $e$ has type $t$ whenever $e$ has type $s$ and $s<t$ We show how to adapt the semantics $S$ in a simple set theoretic way, obtaining a semantics $S'$ that satisfies, in addition to some obvious requirements, also the property that: $S'~s$ is included in $S'~t$, whenever $s < t$.
Item Type:Article
Additional information:Imported from EWI/DB PMS [db-utwente:arti:0000002037]
Copyright:© 1991 Elsevier Science
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:
Official URL:
Export this item as:BibTeX
HTML Citation
Reference Manager


Repository Staff Only: item control page

Metis ID: 118722