The Structural λ-Calculus

DOI10.1007/978-3-642-15205-4_30zbMath1287.03034OpenAlexW120450198MaRDI QIDQ3586054

Delia Kesner, Beniamino Accattoli

Publication date: 3 September 2010

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

Full work available at URL: https://doi.org/10.1007/978-3-642-15205-4_30

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Related Items (20)

Unification for $$\lambda $$ -calculi Without Propagation Rules ⋮ Unnamed Item ⋮ A resource aware semantics for a focused intuitionistic calculus ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Proof nets and the call-by-value \(\lambda\)-calculus ⋮ A strong call-by-need calculus ⋮ Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic ⋮ A faithful and quantitative notion of distant reduction for generalized applications ⋮ Node Replication: Theory And Practice ⋮ Tight typings and split bounds, fully developed ⋮ Unnamed Item ⋮ A prismoid framework for languages with resources ⋮ The spirit of node replication ⋮ The bang calculus revisited ⋮ Classical By-Need ⋮ The bang calculus revisited ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: The Structural λ-Calculus