The Theory of Calculi with Explicit Substitutions Revisited

DOI10.1007/978-3-540-74915-8_20MaRDI QIDQ3608416zbMATH OpenOpenAlexFDO

Authors Delia Kesner

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

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Recommendations

• A Theory of Explicit Substitutions with Safe and Full Composition
• scientific article; zbMATH DE number 1956511
• Normalisation for higher-order calculi with explicit substitutions
• SUBSEXPL: a tool for simulating and comparing explicit substitutions calculi
• scientific article; zbMATH DE number 1500649

Cited in

(28)

• Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic
• A flexible framework for visualisation of computational properties of general explicit substitutions calculi
• Intensional computation with higher-order functions
• The Expansion Problem in Lambda Calculi with Explicit Substitution
• scientific article; zbMATH DE number 1956511 (Why is no real title available?)
• The full-reducing Krivine abstract machine KN simulates pure normal-order reduction in lockstep: a proof via corresponding calculus
• Curry-Style Explicit Substitutions for the Linear and Affine Lambda Calculus
• The Negligible and Yet Subtle Cost of Pattern Matching
• The spirit of node replication
• The Prismoid of Resources
• Term Rewriting and Applications
• New developments in environment machines
• On the Power of Substitution in the Calculus of Structures
• Jumping Boxes
• Normalisation for higher-order calculi with explicit substitutions
• A Theory of Explicit Substitutions with Safe and Full Composition
• Node Replication: Theory And Practice
• Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility
• On explicit substitution with names
• scientific article; zbMATH DE number 4182831 (Why is no real title available?)
• Exponentials as substitutions and the cost of cut elimination in linear logic
• scientific article; zbMATH DE number 2080005 (Why is no real title available?)
• scientific article; zbMATH DE number 6707782 (Why is no real title available?)
• From reduction-based to reduction-free normalization
• A prismoid framework for languages with resources
• An abstract factorization theorem for explicit substitutions
• SUBSEXPL: a tool for simulating and comparing explicit substitutions calculi
• Canonicity of proofs in constructive modal logic

Describes a project that uses

Uses Software

• Miranda

This page was built for publication: The Theory of Calculi with Explicit Substitutions Revisited

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