Relational Parametricity for Control Considered as a Computational Effect

DOI10.1016/j.entcs.2007.02.040zbMath1316.68041OpenAlexW2112242174MaRDI QIDQ5262944

Rasmus Ejlers Møgelberg, Alex K. Simpson

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

zbMATH Keywords

controldenotational semanticscomputational effectsparametric polymorphism

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Functorial polymorphism
• Notions of computation and monads
• A small complete category
• Control categories and duality: on the categorical semantics of the lambda-mu calculus
• Relational Parametricity for Computational Effects
• The Discrete Objects in the Effective Topos
• Classical logic, continuation semantics and abstract machines
• Proofs of strong normalisation for second order classical natural deduction
• Parametric polymorphism and operational equivalence
• Operational Properties of Lily, a Polymorphic Linear Lambda Calculus with Recursion
• Parametricity of extensionally collapsed term models of polymorphism and their categorical properties
• Relational Parametricity and Control
• Linear Abadi and Plotkin Logic
• Computer Science Logic
• Quotients of countably based spaces are not closed under sobrification
• Categorical models for Abadi and Plotkin's logic for parametricity

This page was built for publication: Relational Parametricity for Control Considered as a Computational Effect