No label defined (Q3768897)

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

      Statements

      0 references
      1986
      0 references
      Martin-Löf's constructive type theory
      0 references
      Plotkin's graph model
      0 references
      lambda- calculus
      0 references
      polymorphic typed languages
      0 references
      strict closure semantics
      0 references
      The paper presents an interpretation of Martin-Löf's constructive type theory with one universe \((CST_ 1\) for short) into Plotkin's graph model \(P\omega\) of the lambda-calculus, by interpreting types as closure operators in \(P\omega\) and the relation ``has type'' by ``is fixed point of''. \(CST_ 1\) is presented according to a general plan for generating so-called polymorphic typed languages, used previously by the author. The interpretation of \(CST_ 1\) is established by a ``strict closure semantics'' via the type-free extension LAMBDA of the lambda-calculus \(\lambda\beta\), for which \(P\omega\) is shown to be a model. The following remark has been added in proof. ``Peter de Bruin has noticed that the ``strict closure semantics'' does not yield soundness for the system with one universe. This implies a correction of some statements in this paper, particularly in Sections 34.2, 34.4 and 34.6. Details will be included in a forthcoming paper.''
      0 references

      Identifiers