Checking algorithms for Pure Type Systems (Q6083689): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Introduction to generalized type systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Pearls:<i>Representing ‘undefined’ in lambda calculus</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: The calculus of constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: (In)consistency of Extensions of Higher Order Logic and Type Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4939698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012878 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A framework for defining logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Type checking with universes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Perspective in Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3211296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247306 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3204068 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Typing in pure type systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3856127 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:22, 21 August 2024

scientific article; zbMATH DE number 7774589
Language Label Description Also known as
English
Checking algorithms for Pure Type Systems
scientific article; zbMATH DE number 7774589

    Statements

    Identifiers