Existential Type Systems with No Types in Terms (Q3637189): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A normalization-procedure for the first order classical natural deduction with full logical symbols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive proofs of the range property in lambda calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domain-free pure type systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536445 / rank
 
Normal rank
Property / cites work
 
Property / cites work: CPS-translation as adjoint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Typed Lambda Calculi and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The undecidability of the semi-unification problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3142167 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5559220 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on the Curry-Howard isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Typability and type checking in System F are equivalent and undecidable / rank
 
Normal rank

Latest revision as of 17:58, 1 July 2024

scientific article
Language Label Description Also known as
English
Existential Type Systems with No Types in Terms
scientific article

    Statements

    Identifiers