Pure type systems with explicit substitutions (Q5371956): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(5 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Matita / 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 / cites work
 
Property / cites work: Towards Normalization by Evaluation for the βη-Calculus of Constructions / 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: Pure type systems with judgemental equality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Big-step normalisation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Matita Interactive Theorem Prover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4246942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on the equational theory of non-normalizing pure type systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domain-free pure type systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pure type systems with explicit substitution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Confluence properties of weak and strong calculi of explicit substitutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong normalization of substitutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Formalisation of a Dependently Typed Language as an Inductive-Recursive Family / rank
 
Normal rank
Property / cites work
 
Property / cites work: Internal type theory / 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 Type-Checking Algorithm for Martin-Löf Type Theory with Subtyping Based on Normalisation by Evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Confluence results for the pure strong categorical logic CCL. \(\lambda\)- calculi as subsystems of CCL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Confluence of extensional and non-extensional \(\lambda\)-calculi with explicit substitutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4296744 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4435473 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dependent types and explicit substitutions: a meta-theoretical development / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pure Type System conversion is always typable / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1017/s0956796815000210 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2284245339 / rank
 
Normal rank

Latest revision as of 10:03, 30 July 2024

scientific article; zbMATH DE number 6796897
Language Label Description Also known as
English
Pure type systems with explicit substitutions
scientific article; zbMATH DE number 6796897

    Statements

    Pure type systems with explicit substitutions (English)
    0 references
    0 references
    0 references
    23 October 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers