Polarized proof-nets and \(\lambda \mu\)-calculus

DOI10.1016/S0304-3975(01)00297-3zbMath1019.68021OpenAlexW2031381178MaRDI QIDQ1853586

Olivier Laurent

Publication date: 21 January 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00297-3

zbMATH Keywords

MELL proof-netspolarized proof-nets

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Structure of proofs (03F07) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Combinatory logic and lambda calculus (03B40)

Related Items (14)

Polarized games ⋮ The differential \(\lambda \mu\)-calculus ⋮ Linear $$ \lambda \mu $$ is $$ \textsc {CP} $$ (more or less) ⋮ Resource operators for \(\lambda\)-calculus ⋮ Jump from parallel to sequential proofs: exponentials ⋮ Proof nets and the call-by-value \(\lambda\)-calculus ⋮ Unnamed Item ⋮ Focused linear logic and the \(\lambda\)-calculus ⋮ Multi-focused cut elimination ⋮ Proof nets for classical logic ⋮ Intuitionistic differential nets and lambda-calculus ⋮ An exact correspondence between a typed pi-calculus and polarised proof-nets ⋮ Polarized and focalized linear and classical proofs ⋮ The problem of proof identity, and why computer scientists should care about Hilbert's 24th problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An equivalence between lambda- terms
• Control categories and duality: on the categorical semantics of the lambda-mu calculus
• λμ-calculus and Böhm's theorem
• A new constructive logic: classic logic
• A new deconstructive logic: linear logic

This page was built for publication: Polarized proof-nets and \(\lambda \mu\)-calculus