Resource approximation for the \(\lambda \mu \)-calculus

DOI10.1145/3531130.3532469MaRDI QIDQ6649457

Davide Barbarossa

Publication date: 6 December 2024

zbMATH Keywords

linear logicTaylor expansion\( \lambda \)-calculus\( \lambda \mu \)-calculusresource approximation

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Böhm theorem and Böhm trees for the \(\varLambda \mu\)-calculus
• Linear logic
• Uniformity and the Taylor expansion of ordinary lambda-terms
• Partitions of multisets
• Polarized proof-nets and \(\lambda \mu\)-calculus
• The differential lambda-calculus
• Taylor expansion, finiteness and strategies
• Proof-net as graph, Taylor expansion as pullback
• The differential \(\lambda \mu\)-calculus
• \(\lambda\mu\)-calculus and Böhm's theorem
• Standardization and Böhm Trees for Λμ-Calculus
• On the Taylor expansion of probabilistic λ-terms
• Taylor expansion for Call-By-Push-Value
• Glueability of resource proof-structures: inverting the Taylor expansion

This page was built for publication: Resource approximation for the \(\lambda \mu \)-calculus

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