Closed reduction: explicit substitutions without \alpha -conversion

DOI10.1017/S0960129504004633MaRDI QIDQ4675772zbMATH OpenOpenAlexFDO

Authors Maribel Fernández, Ian Mackie, 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

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

Cited in

(15)

• Nominal rewriting
• 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
• Encoding the Pure Lambda Calculus into Hierarchical Graph Rewriting
• SUBSEXPL: a tool for simulating and comparing explicit substitutions calculi
• The dynamic geometry of interaction machine: a token-guided graph rewriter
• Token-passing optimal reduction with embedded read-back
• New developments in environment machines
• Hard life with weak binders
• Linearity and iterator types for Gödel's system \(\mathcal T\)
• Choices in representation and reduction strategies for lambda terms in intensional contexts
• Gödel's system T revisited

Describes a project that uses

Uses Software

• Automath

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4675772)