Relational interpretations of recursive types in an operational setting (Q4364397)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1088048
Language Label Description Also known as
default for all languages
No label defined
    English
    Relational interpretations of recursive types in an operational setting
    scientific article; zbMATH DE number 1088048

      Statements

      0 references
      0 references
      17 November 1997
      0 references
      type system
      0 references
      domain model
      0 references
      simply typed fragment of ML
      0 references
      relational interpretation
      0 references
      operational equivalence
      0 references
      operational semantics
      0 references
      Relational interpretations of recursive types in an operational setting (English)
      0 references
      In this paper, a simply typed fragment of ML with one top-level recursive type is defined in order to study the construction of relational interpretation. First of all, the notion of operational equivalence is defined and some basic properties are proved. After that the authors show how to construct a relational interpretation of types over an operational semantics. It is proved that the relational interpretation of types is sound in the sense that well-typed terms are related to themselves by the relation associated to their type. Using the construction of the relational interpretation of types, a relational proof of the cps conversion is given. The last section of the paper reviews some related work and points out some future research which can derive from these results. For the entire collection see [Zbl 0871.00032].
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references