Consuming and persistent types for classical logic

DOI10.1145/3373718.3394774MaRDI QIDQ5145668zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

classical logicexact measuresintersection and union typeslambda-mu calculusnatural deduction

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Recommendations

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

Cited in

(5)

• scientific article; zbMATH DE number 7204443 (Why is no real title available?)
• scientific article; zbMATH DE number 7756108 (Why is no real title available?)
• The bang calculus revisited
• Quantitative weak linearisation
• Semantic bounds and multi types, revisited

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)