Parametric polymorphism and operational equivalence
From MaRDI portal
Publication:4500171
DOI10.1017/S0960129500003066zbMath0955.68024MaRDI QIDQ4500171
Publication date: 4 September 2000
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Related Items (30)
Semantics of value recursion for Monadic Input/Output ⋮ A principled approach to programming with nested types in Haskell ⋮ On assertion-based encapsulation for object invariants and simulations ⋮ The Girard-Reynolds isomorphism (second edition) ⋮ Operationally-based program equivalence proofs using LCTRSs ⋮ Semantic preservation for a type directed translation scheme of Featherweight Go ⋮ Safety of Nöcker's strictness analysis ⋮ Call-by-name extensionality and confluence ⋮ Unnamed Item ⋮ A Characterisation of Lambda Definability with Sums Via ⊤ ⊤-Closure Operators ⋮ Parametricity for primitive nested types ⋮ Domain-theoretical models of parametric polymorphism ⋮ Selective strictness and parametricity in structural operational semantics, inequationally ⋮ Relating Computational Effects by ⊤ ⊤-Lifting ⋮ A bisimulation for dynamic sealing ⋮ Parametricity, type equality, and higher-order polymorphism ⋮ Codensity Lifting of Monads and its Dual ⋮ Full abstraction for polymorphic \(\pi \)-calculus ⋮ Operational Properties of Lily, a Polymorphic Linear Lambda Calculus with Recursion ⋮ Abstracting models of strong normalization for classical calculi ⋮ A family of syntactic logical relations for the semantics of Haskell-like languages ⋮ Unnamed Item ⋮ Parametricity for Haskell with Imprecise Error Semantics ⋮ Observational program calculi and the correctness of translations ⋮ Genericity and the \(\pi\)-calculus ⋮ Syntactic Logical Relations for Polymorphic and Recursive Types ⋮ Relational Parametricity for Control Considered as a Computational Effect ⋮ Free Theorems and Runtime Type Representations ⋮ Realizability models for a linear dependent PCF ⋮ Program equivalence in linear contexts
This page was built for publication: Parametric polymorphism and operational equivalence
