Pages that link to "Item:Q2864153"

The following pages link to Syntactic logical relations for polymorphic and recursive types (Q2864153):

Displaying 20 items.

• Polymorphic type inference for the relational algebra (Q696968) (← links)
• 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)
• Relational interpretations of recursive types in an operational setting. (Q1854316) (← links)
• Combinatory logic with polymorphic types (Q2144609) (← links)
• Logical relations for monadic types (Q3545276) (← 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)
• (Q4230924) (← links)
• (Q4281669) (← links)
• (Q4411847) (← 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)
• Programming Languages and Systems (Q5493373) (← links)
• A type-directed, dictionary-passing translation of method overloading and structural subtyping in Featherweight Generic Go (Q6065507) (← links)
• A fibrational tale of operational logical relations: pure, effectful and differential (Q6563048) (← links)