Control categories and duality: on the categorical semantics of the lambda-mu calculus
From MaRDI portal
Publication:2719799
DOI10.1017/S096012950000311XzbMath0984.18003OpenAlexW2152013675MaRDI QIDQ2719799
Publication date: 17 July 2001
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s096012950000311x
Related Items (41)
Polarized games ⋮ On the call-by-value CPS transform and its semantics ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Linear $$ \lambda \mu $$ is $$ \textsc {CP} $$ (more or less) ⋮ Call-by-push-value: Decomposing call-by-value and call-by-name ⋮ Categorical proof theory of classical propositional calculus ⋮ Realizability for Peano arithmetic with winning conditions in HON games ⋮ A categorical semantics for polarized MALL ⋮ Call-by-Value Is Dual to Call-by-Name, Extended ⋮ Galois connecting call-by-value and call-by-name ⋮ Categorical foundations of gradient-based learning ⋮ Cartesian effect categories are Freyd-categories ⋮ Resource modalities in tensor logic ⋮ Proof nets for classical logic ⋮ A proof-theoretic foundation of abortive continuations ⋮ Classical Call-by-Need and Duality ⋮ Classical realizability in the CPS target language ⋮ Second-order type isomorphisms through game semantics ⋮ Classical natural deduction for S4 modal logic ⋮ Continuation semantics for the Lambek-Grishin calculus ⋮ Classical \(F_{\omega}\), orthogonality and symmetric candidates ⋮ On the unity of duality ⋮ Game semantics and linear CPS interpretation ⋮ On categorical models of classical logic and the Geometry of Interaction ⋮ A phase semantics for polarized linear logic and second order conservativity ⋮ Investigations on the dual calculus ⋮ Proof theory in the abstract ⋮ The problem of proof identity, and why computer scientists should care about Hilbert's 24th problem ⋮ Call-By-Push-Value from a Linear Logic Point of View ⋮ Unnamed Item ⋮ Dual Calculus with Inductive and Coinductive Types ⋮ Denotational Semantics of Call-by-name Normalization in Lambda-mu Calculus ⋮ Adjunction Models For Call-By-Push-Value With Stacks ⋮ CPS-translation as adjoint ⋮ Syntax vs. semantics: A polarized approach ⋮ Assertions, Hypotheses, Conjectures, Expectations: Rough-Sets Semantics and Proof Theory ⋮ Order-enriched categorical models of the classical sequent calculus ⋮ An interpretation of \(\lambda \mu\)-calculus in \(\lambda\)-calculus. ⋮ Polarized proof-nets and \(\lambda \mu\)-calculus ⋮ Relational Parametricity for Control Considered as a Computational Effect
This page was built for publication: Control categories and duality: on the categorical semantics of the lambda-mu calculus
