No label defined (Q3334068)

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

      Statements

      0 references
      1984
      0 references
      programming languages
      0 references
      type theory
      0 references
      data types
      0 references
      lambda calculus
      0 references
      logical reconstruction of the type system of Russell
      0 references
      type abstraction
      0 references
      syntax
      0 references
      type inference rules
      0 references
      operational semantics
      0 references
      [For the entire collection see Zbl 0534.00019.] A logical reconstruction of the type system of Russell is presented. The type abstraction system of Russell is explained using language from universal algebra, and this abstraction mechanism is related to constructive mathematics. A small ''kernel'' language, KR, incorporating these ideas, is given by specifying the syntax, type inference rules, and operational semantics. The formal properties of KR are briefly explored. Several standard meta-theorems about the inference rules are stated. The most interesting observation is that the standard subject-reduction theorem of the \(\lambda\)-calculus fails in the system. The paper concludes with a discussion of the translation of Russell into KR. The author is continuing to explore the relationship between KR and the intuitionistic type theory of Martin-Löf. Semantic soundness results should be appearing as Cornell University technical reports in early 1985.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references