Logical equivalence for subtyping object and recursive types (Q2481559): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4715213 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domain theory in logical form / rank
 
Normal rank
Property / cites work
 
Property / cites work: Full abstraction in the lazy lambda calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursion over realizability structures / 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: Inheritance as implicit coercion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modest model of records, inheritance, and bounded quantification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2778829 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997016 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semantics and logic of object calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete restrictions of the intersection type discipline / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection type assignment systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Computer Science / rank
 
Normal rank

Latest revision as of 20:13, 27 June 2024

scientific article
Language Label Description Also known as
English
Logical equivalence for subtyping object and recursive types
scientific article

    Statements

    Identifiers