No label defined (Q3323252)

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 3854400
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3854400

      Statements

      1984
      0 references
      representation independence
      0 references
      TypeL
      0 references
      extended polymorphic \(\lambda\)- calculus
      0 references
      denotational semantics
      0 references
      [For the entire collection see Zbl 0534.00019.] The portability of programs across compilers and machines is enhanced by data type facilities that guarantee ''representation independence''. Intuitively, this refers to the ability to modify, within certain limits, the representation of primitive data types without affecting the meaning of programs. We precisely define two characterizations of representation independence in the context of TypeL, an extended polymorphic \(\lambda\)- calculus. TypeL extensions include mutually recursive normal and type expressions, and an equality predicate. TypeL is given a denotational semantics based on Scott domains in which types are strict closures (retracts that extend the identity function). It is then proved that TypeL is well-typed, and maintains representation independence given appropriate restrictions on the type and value environments. This result may be applied to a higher level language by expressing its semantics in TypeL, as is illustrated by a sample Russell program. This is of particular value in the design of languages with highly general data type facilities, including such features as polymorphism and recursive types, for which representation independence is not obvious.
      0 references

      Identifiers