Subtyping can have a simple semantics (Q1177151): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q276486 |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: John C. Mitchell / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3332229 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3766840 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4173321 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4722037 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3216629 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3677139 / rank | |||
Normal rank |
Latest revision as of 11:25, 15 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Subtyping can have a simple semantics |
scientific article |
Statements
Subtyping can have a simple semantics (English)
0 references
26 June 1992
0 references
The semantics of typed languages are usually given by assigning some kind of collection to each type and interpreting an expression of some type as an element of the appropriate set. With subtyping, it is natural to assume that if \(A\) is a subtype of \(B\) then either (i) there is a conversion function \(c_{AB} : A \rightarrow B\), or (ii) the interpretation of \(A\) is a subset of the interpretation of \(B\). A priori, the first seems more general, but the second more intuitive. This paper gives a relatively straightforward construction, for an example function calculus, showing that any semantic structure satisfying condition (i) may be used to construct a semantic structure satisfying condition (ii). The main idea is simply to replace the interpretation of a type \(A\) by the union of the interpretations of all subtypes of \(A\). The only nontrivial problem is to give a coherent interpretation of expressions.
0 references
semantics of typed languages
0 references