Computer Science Logic

DOI10.1007/11538363MaRDI QIDQ5394579zbMATH OpenOpenAlexFDO

Authors Esfandiar Haghverdi, Philip Scott

Publication date 1 November 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11538363

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Recommendations

• Towards a typed geometry of interaction
• Interaction graphs: additives
• Proofs as Polynomials
• Typed GoI for Exponentials
• Interaction graphs: multiplicatives

Cited in

(17)

• Partially traced categories
• scientific article; zbMATH DE number 1722659 (Why is no real title available?)
• From geometry of interaction to denotational semantics
• Geometry of interaction and the dynamics of proof reduction: a tutorial
• Towards a typed geometry of interaction
• Typed GoI for Exponentials
• scientific article; zbMATH DE number 4123722 (Why is no real title available?)
• A Hoare logic for linear systems
• On geometry of interaction for polarized linear logic
• A \(\mathsf{MALL}\) geometry of interaction based on indexed linear logic
• The Dynamic Geometry of Interaction Machine: A Call-by-Need Graph Rewriter
• Towards a geometry of recursion
• Geometry of synthesis III
• Proofs as Polynomials
• Representation of partial traces
• On strictifying extensional reflexivity in compact closed categories
• Type interaction models and the rule of six

This page was built for publication: Computer Science Logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5394579)