A Theory of Explicit Substitutions with Safe and Full Composition

DOI10.2168/LMCS-5(3:1)2009zbMath1168.68008arXiv0905.2539MaRDI QIDQ3395095

Delia Kesner

Publication date: 20 August 2009

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0905.2539

Mathematics Subject Classification ID

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

Related Items (9)

Unification for $$\lambda $$ -calculi Without Propagation Rules ⋮ Unnamed Item ⋮ On explicit substitution with names ⋮ A strong call-by-need calculus ⋮ Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic ⋮ Node Replication: Theory And Practice ⋮ The spirit of node replication ⋮ A Flexible Framework for Visualisation of Computational Properties of General Explicit Substitutions Calculi ⋮ The full-reducing Krivine abstract machine KN simulates pure normal-order reduction in lockstep: A proof via corresponding calculus

This page was built for publication: A Theory of Explicit Substitutions with Safe and Full Composition