Pages that link to "Item:Q5385588"
From MaRDI portal
The following pages link to Relational Reasoning for Recursive Types and References (Q5385588):
Displaying 13 items.
- A relational realizability model for higher-order stateful ADTs (Q444500) (← links)
- Typing termination in a higher-order concurrent imperative language (Q979082) (← links)
- Relational interpretations of recursive types in an operational setting. (Q1854316) (← links)
- A Nominal Relational Model for Local Store (Q3178267) (← links)
- Realisability semantics of parametric polymorphism, general references and recursive types (Q3583027) (← links)
- Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types (Q3617747) (← links)
- A Complete Characterization of Observational Equivalence in Polymorphic λ-Calculus with General References (Q3644766) (← links)
- (Q4230924) (← links)
- (Q4281669) (← links)
- Proof-Relevant Logical Relations for Name Generation (Q4637685) (← links)
- Global State Considered Helpful (Q5415641) (← links)
- Relational and Kleene-Algebraic Methods in Computer Science (Q5712432) (← links)
- From bounded checking to verification of equivalence via symbolic up-to techniques (Q6535615) (← links)