Capture-Avoiding Substitution as a Nominal Algebra

DOI10.1007/11921240_14MaRDI QIDQ3525150zbMATH OpenOpenAlexFDO

Authors Aad Mathijssen, Murdoch J. Gabbay

Publication date 11 September 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11921240_14

Mathematics Subject Classification ID

Logic in computer science (03B70) Grammars and rewriting systems (68Q42)

Recommendations

• Capture-avoiding substitution as a nominal algebra
• A Nominal Axiomatization of the Lambda Calculus
• Nominal (universal) algebra: equational logic with names and binding
• scientific article; zbMATH DE number 1870536
• Substitution revisited

Cited in

(12)

• A study of substitution, using nominal techniques and Fraenkel-Mostowksi sets
• Two-level nominal sets and semantic nominal terms: an extension of nominal set theory for handling meta-variables
• Nominal Matching and Alpha-Equivalence
• Unity in nominal equational reasoning: the algebra of equality on nominal sets
• scientific article; zbMATH DE number 1870536 (Why is no real title available?)
• Two-level lambda-calculus
• Abstract syntax: substitution and binders
• a-logic with arrows
• PNL to HOL: from the logic of nominal sets to the logic of higher-order functions
• Representation and duality of the untyped \(\lambda\)-calculus in nominal lattice and topological semantics, with a proof of topological completeness
• Capture-avoiding substitution as a nominal algebra
• Matching and alpha-equivalence check for nominal terms

This page was built for publication: Capture-Avoiding Substitution as a Nominal Algebra

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