Extending the explicit substitution paradigm

DOI10.1007/978-3-540-32033-3_30MaRDI QIDQ5703866zbMATH OpenOpenAlexFDO

Authors Delia Kesner, Stéphane Lengrand

Publication date 11 November 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b135673

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Logic in computer science (03B70) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Grammars and rewriting systems (68Q42)

Recommendations

• Resource operators for \(\lambda\)-calculus
• Proof nets and explicit substitutions
• scientific article; zbMATH DE number 512773
• A Theory of Explicit Substitutions with Safe and Full Composition
• The Theory of Calculi with Explicit Substitutions Revisited

Cited in

(10)

• Proof nets and the linear substitution calculus
• On explicit substitution with names
• scientific article; zbMATH DE number 1070568 (Why is no real title available?)
• scientific article; zbMATH DE number 1508928 (Why is no real title available?)
• Proof nets and explicit substitutions
• Strongly-Normalizing Higher-Order Relational Queries
• A nonstandard standardization theorem
• Exponentials as substitutions and the cost of cut elimination in linear logic
• Resource operators for \(\lambda\)-calculus
• A \(\rho\)-calculus of explicit constraint application

This page was built for publication: Extending the explicit substitution paradigm

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