Pages that link to "Item:Q4500171"

The following pages link to Parametric polymorphism and operational equivalence (Q4500171):

Displaying 29 items.

• A principled approach to programming with nested types in Haskell (Q848745) (← links)
• The Girard-Reynolds isomorphism (second edition) (Q879366) (← links)
• A family of syntactic logical relations for the semantics of Haskell-like languages (Q1012131) (← links)
• Parametricity for primitive nested types (Q2233419) (← links)
• Abstracting models of strong normalization for classical calculi (Q2291828) (← links)
• Observational program calculi and the correctness of translations (Q2339472) (← links)
• Realizability models for a linear dependent PCF (Q2346992) (← links)
• Program equivalence in linear contexts (Q2346993) (← links)
• Domain-theoretical models of parametric polymorphism (Q2464940) (← links)
• Selective strictness and parametricity in structural operational semantics, inequationally (Q2464947) (← links)
• Full abstraction for polymorphic \(\pi \)-calculus (Q2474052) (← links)
• Genericity and the \(\pi\)-calculus (Q2576663) (← links)
• On assertion-based encapsulation for object invariants and simulations (Q2643129) (← links)
• Syntactic Logical Relations for Polymorphic and Recursive Types (Q2864153) (← links)
• Relating Computational Effects by ⊤ ⊤-Lifting (Q3012918) (← links)
• Safety of Nöcker's strictness analysis (Q3520168) (← links)
• A Characterisation of Lambda Definability with Sums Via ⊤ ⊤-Closure Operators (Q3540185) (← links)
• Parametricity, type equality, and higher-order polymorphism (Q3564921) (← links)
• Parametricity for Haskell with Imprecise Error Semantics (Q3637203) (← links)
• Codensity Lifting of Monads and its Dual (Q4553284) (← links)
• Semantics of value recursion for Monadic Input/Output (Q4787832) (← links)
• Operational Properties of Lily, a Polymorphic Linear Lambda Calculus with Recursion (Q4921510) (← links)
• (Q5028445) (← links)
• Relational Parametricity for Control Considered as a Computational Effect (Q5262944) (← links)
• Free Theorems and Runtime Type Representations (Q5262947) (← links)
• Call-by-name extensionality and confluence (Q5372008) (← links)
• (Q5377471) (← links)
• A bisimulation for dynamic sealing (Q5899331) (← links)
• Operationally-based program equivalence proofs using LCTRSs (Q6052946) (← links)