scientific article; zbMATH DE number 1070568
From MaRDI portal
Publication:4357055
zbMath0883.03008MaRDI QIDQ4357055
Publication date: 5 October 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
explicit substitutionscombinatory reduction systemssubject reductiontyped \(\lambda\)-calculipreservation of strong normalizationrecursive path orders
Related Items
Unnamed Item, Intersection types for explicit substitutions, The Prismoid of Resources, On explicit substitution with names, Revisiting the notion of function, A prismoid framework for languages with resources, Capture-avoiding substitution as a nominal algebra, 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, Strong Normalisation of Cut-Elimination That Simulates β-Reduction, Revisiting Zucker’s Work on the Correspondence Between Cut-Elimination and Normalisation
Uses Software