Consuming and persistent types for classical logic

DOI10.1145/3373718.3394774zbMATH Open1498.03042OpenAlexW3031314371WikidataQ130829079 ScholiaQ130829079MaRDI QIDQ5145668FDOQ5145668

Authors: Delia Kesner, Pierre Vial 

Publication date: 21 January 2021

Published in: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3373718.3394774

Recommendations

• scientific article; zbMATH DE number 7204443
• Types for Proofs and Programs
• The \(\lambda \mu^{\mathbf{T}}\)-calculus
• Intersection types for the \(\lambda\mu\)-calculus
• Programming and Proving with Classical Types

zbMATH Keywords

natural deductionclassical logiclambda-mu calculusintersection and union typesexact measures

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Cited In (3)

• Quantitative weak linearisation
• The bang calculus revisited
• Title not available (Why is that?)

This page was built for publication: Consuming and persistent types for classical logic

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