Parametric polymorphism and operational equivalence
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1231605
- Parametricity, type equality, and higher-order polymorphism
- Operational equivalences for untyped and polymorphic object calculi
- Formal parametric polymorphism
- scientific article; zbMATH DE number 742721
- Parametric Polymorphism — Universally
- scientific article; zbMATH DE number 512792
- Quantifier elimination and parametric polymorphism in programming languages
- scientific article; zbMATH DE number 4154448
- Parametric polymorphism and semantic subtyping
Cited in
(48)- A family of syntactic logical relations for the semantics of Haskell-like languages
- A trace semantics for System F parametric polymorphism
- Parametricity for primitive nested types
- Abstracting models of strong normalization for classical calculi
- Observational program calculi and the correctness of translations
- Realizability models for a linear dependent PCF
- Program equivalence in linear contexts
- Domain-theoretical models of parametric polymorphism
- Selective strictness and parametricity in structural operational semantics, inequationally
- Full abstraction for polymorphic \(\pi \)-calculus
- Genericity and the \(\pi\)-calculus
- On assertion-based encapsulation for object invariants and simulations
- Operational equivalences for untyped and polymorphic object calculi
- Logical relations and parametricity -- a Reynolds programme for category theory and programming languages
- A simple proof technique for certain parametricity results
- Syntactic logical relations for polymorphic and recursive types
- Parametric Polymorphism — Universally
- Relating Computational Effects by ⊤ ⊤-Lifting
- Safety of Nöcker's strictness analysis
- A Characterisation of Lambda Definability with Sums Via ⊤ ⊤-Closure Operators
- Testing polymorphic properties
- Parametricity, type equality, and higher-order polymorphism
- Parametricity for Haskell with Imprecise Error Semantics
- A Complete Characterization of Observational Equivalence in Polymorphic λ-Calculus with General References
- scientific article; zbMATH DE number 1231605 (Why is no real title available?)
- scientific article; zbMATH DE number 2061707 (Why is no real title available?)
- scientific article; zbMATH DE number 1479610 (Why is no real title available?)
- Codensity lifting of monads and its dual
- Quantifier elimination and parametric polymorphism in programming languages
- Semantics of value recursion for Monadic Input/Output
- On monadic parametricity of second-order functionals
- Operational properties of \texttt{Lily}, a polymorphic linear lambda calculus with recursion
- Parametricity for nested types and GADTs
- Relational parametricity for control considered as a computational effect
- Free theorems and runtime type representations
- Mathematics of Program Construction
- Call-by-name extensionality and confluence
- Bisimulations for delimited-control operators
- A bisimulation for dynamic sealing
- Operationally-based program equivalence proofs using LCTRSs
- Semantic preservation for a type directed translation scheme of Featherweight Go
- Logical predicates in higher-order mathematical operational semantics
- GADTs, functoriality, parametricity: pick two
- A contextual formalization of structural coinduction
- Bialgebraic reasoning on higher-order program equivalence
- On model-theoretic strong normalization for truth-table natural deduction
- A principled approach to programming with nested types in Haskell
- The Girard-Reynolds isomorphism (second edition)
This page was built for publication: Parametric polymorphism and operational equivalence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4500171)
