A strong bisimulation for a classical term calculus

DOI10.46298/LMCS-20(2:4)2024MaRDI QIDQ6563051zbMATH OpenFDO

Authors Eduardo Bonelli, Delia Kesner, Andrés Viso

Publication date 27 June 2024

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.46298/LMCS-20(2:4)2024

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites work

• A fully-abstract semantics of in the -calculus
• A new constructive logic: classic logic
• A nonstandard standardization theorem
• A resource aware semantics for a focused intuitionistic calculus
• A Theory of Explicit Substitutions with Safe and Full Composition
• An equivalence between lambda- terms
• An exact correspondence between a typed pi-calculus and polarised proof-nets
• Atomic lambda calculus: a typed lambda-calculus with explicit sharing
• Church-Rosser property of a simple reduction for full first-order classical natural deduction
• Confluence properties of weak and strong calculi of explicit substitutions
• Distilling abstract machines
• scientific article; zbMATH DE number 1324438 (Why is no real title available?)
• scientific article; zbMATH DE number 517083 (Why is no real title available?)
• scientific article; zbMATH DE number 2079018 (Why is no real title available?)
• scientific article; zbMATH DE number 7650817 (Why is no real title available?)
• Linear logic
• Polarized proof-nets and \(\lambda \mu\)-calculus
• Preservation of strong normalisation modulo permutations for the structural -calculus
• Proof nets and the linear substitution calculus
• Term Rewriting and All That
• The duality of computation
• The permutative -calculus
• The structural \(\lambda \)-calculus

This page was built for publication: A strong bisimulation for a classical term calculus

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