Relational parametricity for control considered as a computational effect
DOI10.1016/J.ENTCS.2007.02.040zbMATH Open1316.68041OpenAlexW2112242174MaRDI QIDQ5262944FDOQ5262944
Alex Simpson, Rasmus Ejlers Møgelberg
Publication date: 10 July 2015
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2007.02.040
Recommendations
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)
Cites Work
- Notions of computation and monads
- Title not available (Why is that?)
- Categorical models for Abadi and Plotkin's logic for parametricity
- A small complete category
- Control categories and duality: On the categorical semantics of the lambda-mu calculus
- Title not available (Why is that?)
- Classical logic, continuation semantics and abstract machines
- The Discrete Objects in the Effective Topos
- Title not available (Why is that?)
- Relational Parametricity and Control
- Proofs of strong normalisation for second order classical natural deduction
- Computer Science Logic
- Parametricity of extensionally collapsed term models of polymorphism and their categorical properties
- Functorial polymorphism
- Parametric polymorphism and operational equivalence
- Operational Properties of Lily, a Polymorphic Linear Lambda Calculus with Recursion
- Linear Abadi and Plotkin Logic
- Quotients of countably based spaces are not closed under sobrification
- Title not available (Why is that?)
- Relational Parametricity for Computational Effects
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)
