An implementation of LF with coercive subtyping and universes (Q5951521): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1023/a:1010648911114 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1813213602 / rank
 
Normal rank

Latest revision as of 09:58, 30 July 2024

scientific article; zbMATH DE number 1686106
Language Label Description Also known as
English
An implementation of LF with coercive subtyping and universes
scientific article; zbMATH DE number 1686106

    Statements

    An implementation of LF with coercive subtyping and universes (English)
    0 references
    0 references
    0 references
    5 November 2003
    0 references
    An implementation of a variant of Martin-Löf's logical framework with coercive subtyping, called LF, is presented. The paper begins with an outline of LF with its extensions of inductive types and coercions; then, motivations and the basic architecture of the implementation are given; finally, some examples are presented. In particular, special emphasis is put on the implementation of the the theory of a hierarchy of universes included in the object type theory UTT, which is outlined and implemented. The relationships between universes and inductive types, and between universes and coercive subtyping are studied and, as a conclusion, the authors claim that the combination of Tarski-style universes together with coercive subtyping provides an ideal formulation of universes that is both semantically clear and practical to use.
    0 references
    type theory
    0 references
    universes
    0 references
    logical framework
    0 references
    implementation
    0 references
    0 references
    0 references

    Identifiers