The Theory of Calculi with Explicit Substitutions Revisited
From MaRDI portal
Publication:3608416
DOI10.1007/978-3-540-74915-8_20zbMath1179.03022OpenAlexW1529760921MaRDI QIDQ3608416
Publication date: 5 March 2009
Published in: Computer Science Logic (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.545.1343
Related Items (14)
The Negligible and Yet Subtle Cost of Pattern Matching ⋮ The Prismoid of Resources ⋮ On explicit substitution with names ⋮ Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility ⋮ Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic ⋮ Node Replication: Theory And Practice ⋮ A prismoid framework for languages with resources ⋮ Intensional computation with higher-order functions ⋮ The spirit of node replication ⋮ New Developments in Environment Machines ⋮ Curry-Style Explicit Substitutions for the Linear and Affine Lambda Calculus ⋮ The full-reducing Krivine abstract machine KN simulates pure normal-order reduction in lockstep: A proof via corresponding calculus ⋮ Jumping Boxes ⋮ From Reduction-Based to Reduction-Free Normalization
Uses Software
This page was built for publication: The Theory of Calculi with Explicit Substitutions Revisited
