Pages that link to "Item:Q2864153"
From MaRDI portal
The following pages link to Syntactic Logical Relations for Polymorphic and Recursive Types (Q2864153):
Displaying 11 items.
- Exception tracking in an open world (Q724930) (← links)
- Typing termination in a higher-order concurrent imperative language (Q979082) (← links)
- A family of syntactic logical relations for the semantics of Haskell-like languages (Q1012131) (← links)
- Parametricity, type equality, and higher-order polymorphism (Q3564921) (← 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)
- On the Versatility of Open Logical Relations (Q5041087) (← links)
- A case study in programming coinductive proofs: Howe’s method (Q5236557) (← links)
- Free Theorems and Runtime Type Representations (Q5262947) (← links)
- Correctness of compiling polymorphism to dynamic typing (Q5371998) (← links)
- A type-directed, dictionary-passing translation of method overloading and structural subtyping in Featherweight Generic Go (Q6065507) (← links)
