The emptiness problem for intersection types (Q4934035): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3994895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semantical investigations in Heyting's intuitionistic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functional Characters of Solvable Terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of basic functionality theory for \(\lambda\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A filter lambda model and the completeness of type assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: The completeness of provable realizability / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of type polymorphism in programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection Types as Logical Formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intuitionistic propositional logic is polynomial-space complete / rank
 
Normal rank

Latest revision as of 11:08, 29 May 2024

scientific article; zbMATH DE number 1389462
Language Label Description Also known as
English
The emptiness problem for intersection types
scientific article; zbMATH DE number 1389462

    Statements

    The emptiness problem for intersection types (English)
    0 references
    0 references
    17 January 2000
    0 references
    emptiness problem
    0 references
    logic of strong conjunction
    0 references
    lambda calculus
    0 references
    intersection type assignment
    0 references
    provability
    0 references

    Identifiers