No label defined (Q4247299)

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

      Statements

      0 references
      0 references
      16 June 1999
      0 references
      constructive type theory
      0 references
      setoids
      0 references
      subtyping
      0 references
      Martin-Löf's set theory
      0 references
      algebraic systems
      0 references
      abstract data types
      0 references
      type formation
      0 references
      dependent record types
      0 references
      record type inclusion
      0 references
      Our starting point, to which we refer hereafter as type theory, is the formulation of Martin-Löf's set theory using the theory of types as a logical framework. The question that we address is that of the representation of systems of structures such as algebraic systems or abstract data types. In order to provide a general means to this end, we extend type theory with a new mechanism of type formation, namely that of dependent record types. This allows us to form types of tuples in such a manner as to allow any arbitrary set (i.e. not restricted to be among those generated by a fixed repertoire of set forming operations) to be used as a component of tuples of those types. Such types of tuples cannot be formed in the original theory. Moreover, as is well known from the theory of programming languages, a natural notion of inclusion arises between record types. Given two record types \(\rho\) and \(\rho'\), if \(\rho\) contains every label declared in \(\rho'\) (and possibly more) and the types of the common labels are in the inclusion relation then \(\rho\) is included in \(\rho'\); in symbols, \(\rho\sqsubseteq\rho'\). This is justified because then every object of type \(\rho\) is also an object of type \(\rho'\), since it contains components of appropriate types for all the fields specified in \(\rho'\). Our extension contains the form of judgement \(\alpha\sqsubseteq \beta\) expressing that the type \(\alpha\) is included in the type \(\beta\) and corresponding proof rules, which generalize record type inclusion to dependent record types and propagate it to the rest of the types of the language. In the present formulation, no proper inclusion between ground types is allowed. For the entire collection see [Zbl 0899.00026].
      0 references

      Identifiers