Pages that link to "Item:Q5704031"
From MaRDI portal
The following pages link to Typed Lambda Calculi and Applications (Q5704031):
Displaying 11 items.
- A relational realizability model for higher-order stateful ADTs (Q444500) (← links)
- The category-theoretic solution of recursive metric-space equations (Q604478) (← links)
- Blaming the client: on data refinement in the presence of pointers (Q607403) (← links)
- Typing termination in a higher-order concurrent imperative language (Q979082) (← links)
- A study of substitution, using nominal techniques and Fraenkel-Mostowksi sets (Q1006642) (← links)
- Algorithmic games for full ground references (Q1650867) (← links)
- A Nominal Relational Model for Local Store (Q3178267) (← links)
- On Normalization by Evaluation for Object Calculi (Q3499758) (← links)
- Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types (Q3617747) (← links)
- Proof-Relevant Logical Relations for Name Generation (Q4637685) (← links)
- Global State Considered Helpful (Q5415641) (← links)
