Encoding tight typing in a unified framework

DOI10.4230/LIPICS.CSL.2022.27MaRDI QIDQ6124962zbMATH OpenFDO

Authors Delia Kesner, Andrés Viso

Publication date 10 April 2024

Full work available at URL https://arxiv.org/abs/2105.00564

zbMATH Keywords

call-by-namecall-by-push-valuecall-by-valueintersection types

Mathematics Subject Classification ID

Logic in computer science (03B70)

Recommendations

• Call-by-push-value: Decomposing call-by-value and call-by-name
• The bang calculus revisited
• scientific article; zbMATH DE number 1956517
• Types by need

Cited in

(6)

• A faithful and quantitative notion of distant reduction for the lambda-calculus with generalized applications
• Semantic bounds and multi types, revisited
• Meaningfulness and genericity in a subsuming framework (invited talk)
• A quantitative approach to global state composition
• Hybrid intersection types for PCF
• The benefits of diligence

This page was built for publication: Encoding tight typing in a unified framework

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