Type theory as a foundation for computer science (Q5096219): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3803111 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3702502 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The calculus of constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5622162 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edinburgh LCF. A mechanized logic of computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3204055 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3211296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4099613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999860 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5560258 / rank
 
Normal rank

Latest revision as of 22:16, 29 July 2024

scientific article; zbMATH DE number 7572002
Language Label Description Also known as
English
Type theory as a foundation for computer science
scientific article; zbMATH DE number 7572002

    Statements

    Type theory as a foundation for computer science (English)
    0 references
    16 August 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references