ON STEPWISE EXPLICIT SUBSTITUTION
From MaRDI portal
Publication:4286110
DOI10.1142/S0129054193000146zbMath0806.03013MaRDI QIDQ4286110
Rob Nederpelt, Fairouz Kamareddine
Publication date: 27 April 1994
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Related Items (13)
A unified approach to type theory through a refined \(\lambda\)-calculus ⋮ On explicit substitution with names ⋮ A useful \(\lambda\)-notation ⋮ Refining reduction in the lambda calculus ⋮ Canonical typing and ∏-conversion in the Barendregt Cube ⋮ Comparing Calculi of Explicit Substitutions with Eta-reduction ⋮ Explicit Substitutions à la de Bruijn ⋮ A Flexible Framework for Visualisation of Computational Properties of General Explicit Substitutions Calculi ⋮ Comparing and implementing calculi of explicit substitutions with eta-reduction ⋮ A note on complexity measures for inductive classes in constructive type theory ⋮ Explicit substitution. On the edge of strong normalization ⋮ THE SOUNDNESS OF EXPLICIT SUBSTITUTION WITH NAMELESS VARIABLES ⋮ λν, a calculus of explicit substitutions which preserves strong normalisation
This page was built for publication: ON STEPWISE EXPLICIT SUBSTITUTION
