Explicit substitutions and reducibility

DOI10.1093/LOGCOM/11.3.431MaRDI QIDQ2752530zbMATH OpenOpenAlexFDO

Authors Hugo Herbelin

Publication date 5 May 2002

Published in Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/logcom/11.3.431

zbMATH Keywords

\(\lambda\)-calculusexplicit substitutionsreducibilitystrong normalization

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Recommendations

• Foundations of Software Science and Computation Structures
• Characterising explicit substitutions which preserve termination. (Extended abstract)
• Explicit substitution. On the edge of strong normalization
• Functional and Logic Programming
• \(\lambda\)-calculi with explicit substitutions preserving strong normalization

Cited in

(14)

• Properties of substitutions and unifications
• Primal-circular substitutions
• Intersection types for explicit substitutions
• Call-by-name reduction and cut-elimination in classical logic
• Cut rules and explicit substitutions
• scientific article; zbMATH DE number 4177054 (Why is no real title available?)
• Reduction Under Substitution
• scientific article; zbMATH DE number 1070568 (Why is no real title available?)
• scientific article; zbMATH DE number 1508928 (Why is no real title available?)
• On explicit substitutions and names (extended abstract)
• Substitution, jumps, and algebraic effects
• Foundations of Software Science and Computation Structures
• scientific article; zbMATH DE number 4182831 (Why is no real title available?)
• A type-theoretic foundation of delimited continuations

This page was built for publication: Explicit substitutions and reducibility

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