λ-calculi with explicit substitutions and composition which preserve β-strong normalization

DOI10.1007/3-540-61735-3_19zbMath1355.68039OpenAlexW192222892MaRDI QIDQ2956728

Maria C. F. Ferreira, Delia Kesner, Laurence Puel

Publication date: 19 January 2017

Published in: Algebraic and Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61735-3_19

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Combinatory logic and lambda calculus (03B40)

Related Items (5)

Comparing Calculi of Explicit Substitutions with Eta-reduction ⋮ Comparing and implementing calculi of explicit substitutions with eta-reduction ⋮ Proof-term synthesis on dependent-type systems via explicit substitutions ⋮ Explicit substitution. On the edge of strong normalization ⋮ Confluence of extensional and non-extensional \(\lambda\)-calculi with explicit substitutions

This page was built for publication: λ-calculi with explicit substitutions and composition which preserve β-strong normalization