Closed reduction: explicit substitutions without $\alpha$ -conversion

DOI10.1017/S0960129504004633zbMath1129.68409OpenAlexW2103406007MaRDI QIDQ4675772

Ian Mackie, Maribel Fernández, François-Régis Sinot

Publication date: 6 May 2005

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129504004633

Mathematics Subject Classification ID

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

Related Items (15)

Nominal rewriting ⋮ Choices in representation and reduction strategies for lambda terms in intensional contexts ⋮ Unnamed Item ⋮ Encoding the Pure Lambda Calculus into Hierarchical Graph Rewriting ⋮ Unnamed Item ⋮ Linearity and iterator types for Gödel's system \(\mathcal T\) ⋮ Gödel's system \(\mathcal T\) revisited ⋮ New Developments in Environment Machines ⋮ Hard Life with Weak Binders ⋮ SUBSEXPL: a tool for simulating and comparing explicit substitutions calculi ★ ⋮ A Fully Labelled Lambda Calculus: Towards Closed Reduction in the Geometry of Interaction Machine ⋮ The Power of Closed Reduction Strategies ⋮ Complete Laziness: a Natural Semantics ⋮ Minimality in a Linear Calculus with Iteration ⋮ Token-passing Nets for Functional Languages

Uses Software

• Automath

This page was built for publication: Closed reduction: explicit substitutions without $\alpha$ -conversion