Inductive-data-type systems (Q5958292): Difference between revisions

From MaRDI portal
Changed an Item
Created claim: Wikidata QID (P12): Q127972148, #quickstatements; #temporary_batch_1722355380754
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281465 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modularity of strong normalization in the algebraic-λ-cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2723890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Specification and proof in membership equational logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4205074 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polymorphic rewriting conserves algebraic strong normalization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3703866 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5753923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5610115 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385532 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5625124 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract data type systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3918095 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatory reduction systems: Introduction and survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4099613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher-order rewrite systems and their confluence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logic programming language with lambda-abstraction, function variables, and simple unification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4704206 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4229811 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear unification of higher-order patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4312490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinators, \(\lambda\)-terms and proof theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intensional interpretations of functionals of finite type I / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127972148 / rank
 
Normal rank

Latest revision as of 17:10, 30 July 2024

scientific article; zbMATH DE number 1715293
Language Label Description Also known as
English
Inductive-data-type systems
scientific article; zbMATH DE number 1715293

    Statements

    Inductive-data-type systems (English)
    0 references
    0 references
    0 references
    0 references
    3 March 2002
    0 references
    higher-order rewriting
    0 references
    strong normalization
    0 references
    inductive types
    0 references
    recursive definitions
    0 references
    typed lambda-calculus
    0 references

    Identifiers