Meta-variables as infinite lists in nominal terms unification and rewriting

DOI10.1093/jigpal/jzs005zbMath1278.68119OpenAlexW2004443371MaRDI QIDQ4913996

Murdoch James Gabbay

Publication date: 17 April 2013

Published in: Logic Journal of IGPL (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/jigpal/jzs005

zbMATH Keywords

foundationslogical frameworksbindingnominal algebra\(\alpha \)-equivalencenominal unificationpermissive-nominal logicnominal termsnominal rewriting

Mathematics Subject Classification ID

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

Related Items (4)

Game Semantics in the Nominal Model ⋮ Finite and infinite support in nominal algebra and logic: nominal completeness theorems for free ⋮ 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

This page was built for publication: Meta-variables as infinite lists in nominal terms unification and rewriting