Jumping Boxes

DOI10.1007/978-3-642-04027-6_7MaRDI QIDQ3644740zbMATH OpenOpenAlexFDO

Authors Beniamino Accattoli, Stefano Guerrini

Publication date 12 November 2009

Published in Computer Science Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-04027-6_7

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Structure of proofs (03F07)

Recommendations

• Jump from parallel to sequential proofs: exponentials
• Proof nets and the call-by-value \(\lambda\)-calculus
• Compressing polarized boxes
• scientific article; zbMATH DE number 7356671
• Proof nets and the linear substitution calculus

Cites work

• Coherence for sharing proof-nets
• scientific article; zbMATH DE number 194911 (Why is no real title available?)
• scientific article; zbMATH DE number 1392290 (Why is no real title available?)
• Jump from Parallel to Sequential Proofs: Multiplicatives
• Linear logic
• Proof nets and explicit substitutions
• The optimal implementation of functional programming languages
• The Theory of Calculi with Explicit Substitutions Revisited

Cited in

(10)

• The Prismoid of Resources
• Jump from parallel to sequential proofs: exponentials
• Boxes: A Symbolic Abstract Domain of Boxes
• The dynamic geometry of interaction machine: a token-guided graph rewriter
• Nested term graphs (work in progress)
• Compressing polarized boxes
• A prismoid framework for languages with resources
• The exponential logic of sequentialization
• A robust graph-based approach to observational equivalence
• Proof nets and the call-by-value \(\lambda\)-calculus

This page was built for publication: Jumping Boxes

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