A study of substitution, using nominal techniques and Fraenkel-Mostowksi sets

DOI10.1016/j.tcs.2008.11.013zbMath1159.03019OpenAlexW2060214165MaRDI QIDQ1006642

Murdoch James Gabbay

Publication date: 25 March 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.11.013

zbMATH Keywords

substitutionnominal techniquesFraenkel-Mostowski set theory

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Applications of set theory (03E75) Nonclassical and second-order set theories (03E70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items

Unity in nominal equational reasoning: the algebra of equality on nominal sets, Foundations of Nominal Techniques: Logic and Semantics of Variables in Abstract Syntax, 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, Two-level nominal sets and semantic nominal terms: an extension of nominal set theory for handling meta-variables, Denotational Semantics with Nominal Scott Domains

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new approach to abstract syntax with variable binding
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Capture-avoiding substitution as a nominal algebra
• Natural deduction and arbitrary objects
• A calculus of mobile processes. II
• On the algebraic models of lambda calculus
• Nominal unification
• Nominal logic, a first order theory of names and binding
• A general mathematics of names
• Scrap your boilerplate with class
• A Simple Class of Kripke-Style Models in Which Logic and Computation Have Equal Standing
• One-and-a-halfth-order Logic
• Capture-Avoiding Substitution as a Nominal Algebra
• Axiomatization of polynomial substitution algebras
• The Lattice of Lambda Theories
• On the Notion of Substitution
• Automated Reasoning
• Logic Programming
• Nominal Renaming Sets
• Typed Lambda Calculi and Applications