A Modular Type-Checking Algorithm for Type Theory with Singleton Types and Proof Irrelevance (Q3637183): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Epigram / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Coq / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Automath / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-02273-9_3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1690628218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normalization by Evaluation for Martin-Löf Type Theory with One Universe / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Algebraic Foundation of Proof Assistants for Intuitionistic Type Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying a Semantic βη-Conversion Test for Martin-Löf Type Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Modular Type-checking algorithm for Type Theory with Singleton Types and Proof Irrelevance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Operational aspects of untyped Normalisation by Evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474826 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositions as [Types] / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized algebraic theories and contextual categories / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for type-checking dependent types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4681364 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general formulation of simultaneous inductive-recursive definitions in type theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A compiled implementation of strong reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A framework for defining logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a mechanized metatheory of standard ML / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3688389 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advanced Functional Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kripke-style models for typed lambda calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999860 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2722014 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subset Coercions in Coq / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensional equivalence and singleton types / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the strength of proof-irrelevant type theories / rank
 
Normal rank

Latest revision as of 17:58, 1 July 2024

scientific article
Language Label Description Also known as
English
A Modular Type-Checking Algorithm for Type Theory with Singleton Types and Proof Irrelevance
scientific article

    Statements

    A Modular Type-Checking Algorithm for Type Theory with Singleton Types and Proof Irrelevance (English)
    0 references
    0 references
    0 references
    0 references
    7 July 2009
    0 references
    0 references
    0 references
    0 references

    Identifiers