Relational parametricity for control considered as a computational effect
From MaRDI portal
Publication:5262944
Recommendations
Cites work
- scientific article; zbMATH DE number 3882404 (Why is no real title available?)
- scientific article; zbMATH DE number 19486 (Why is no real title available?)
- scientific article; zbMATH DE number 1770055 (Why is no real title available?)
- scientific article; zbMATH DE number 2120508 (Why is no real title available?)
- A small complete category
- Categorical models for Abadi and Plotkin's logic for parametricity
- Classical logic, continuation semantics and abstract machines
- Computer Science Logic
- Control categories and duality: On the categorical semantics of the lambda-mu calculus
- Functorial polymorphism
- Linear Abadi and Plotkin Logic
- Notions of computation and monads
- Operational properties of \texttt{Lily}, a polymorphic linear lambda calculus with recursion
- Parametric polymorphism and operational equivalence
- Parametricity of extensionally collapsed term models of polymorphism and their categorical properties
- Proofs of strong normalisation for second order classical natural deduction
- Quotients of countably based spaces are not closed under sobrification
- Relational Parametricity and Control
- Relational Parametricity for Computational Effects
- The Discrete Objects in the Effective Topos
Cited in
(4)
This page was built for publication: Relational parametricity for control considered as a computational effect
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5262944)