Lambda-calculus with director strings

DOI10.1007/s00200-005-0169-9zbMath1101.68451OpenAlexW1974822280MaRDI QIDQ1778107

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

Publication date: 16 June 2005

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00200-005-0169-9

zbMATH Keywords

StrategiesDirector StringsExplicit Substitutions

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40)

Related Items (4)

On explicit substitution with names ⋮ Spinal atomic \(\lambda\)-calculus ⋮ A prismoid framework for languages with resources ⋮ New Developments in Environment Machines

Uses Software

• Automath

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Explicit substitution. On the edge of strong normalization
• On theories with a combinatorial definition of 'equivalence'
• A λ-calculus with explicit weakening and explicit substitution
• Optimality and inefficiency
• A compiled implementation of strong reduction
• λν, a calculus of explicit substitutions which preserves strong normalisation
• Director strings as combinators
• Functional runtime systems within the lambda-sigma calculus
• The bologna optimal higher-order machine
• Confluence properties of weak and strong calculi of explicit substitutions
• The Suspension Notation for Lambda Terms and its Use in Metalanguage Implementations
• Explicit substitutions
• Optimistic evaluation
• Tree-Manipulating Systems and Church-Rosser Theorems

This page was built for publication: Lambda-calculus with director strings