Publication:4357055
From MaRDI portal
zbMath0883.03008MaRDI QIDQ4357055
Publication date: 5 October 1997
explicit substitutions; combinatory reduction systems; subject reduction; typed \(\lambda\)-calculi; preservation of strong normalization; recursive path orders
03B40: Combinatory logic and lambda calculus
Related Items
Strong Normalisation of Cut-Elimination That Simulates β-Reduction, Proof-term synthesis on dependent-type systems via explicit substitutions, Capture-avoiding substitution as a nominal algebra, Revisiting the notion of function, Comparing and implementing calculi of explicit substitutions with eta-reduction, Intersection types for explicit substitutions, Unnamed Item
Uses Software