Subtyping can have a simple semantics

H. Balsters, M.M. Fokkinga

Research output: Contribution to journalArticleAcademicpeer-review

8 Citations (Scopus)
94 Downloads (Pure)

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$.
Original languageUndefined
Pages (from-to)81-96
Number of pages16
JournalTheoretical computer science
Volume87
Issue number1
DOIs
Publication statusPublished - 1991

Keywords

  • DB-OODB: OBJECT-ORIENTED DATABASES
  • DB-PRJTM: TWENTE-MILANO
  • IR-66228
  • METIS-118722
  • EWI-6255

Cite this