Permissive nominal terms and their unification: an infinite, co-infinite approach to nominal techniques
From MaRDI portal
Publication:3061275
DOI10.1093/jigpal/jzq006zbMath1215.03048OpenAlexW2040792231MaRDI QIDQ3061275
Dominic P. Mulligan, Gilles Dowek, Murdoch James Gabbay
Publication date: 14 December 2010
Published in: Logic Journal of the IGPL (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/jigpal/jzq006
Logic in computer science (03B70) Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items
Higher-order pattern anti-unification in linear time, Finite and infinite support in nominal algebra and logic: nominal completeness theorems for free, Nominal Unification and Matching of Higher Order Expressions with Recursive Let, Nominal syntax with atom substitutions, Exploring nominal cellular automata, Unity in nominal equational reasoning: the algebra of equality on nominal sets, Curry-Howard for incomplete first-order logic derivations using one-and-a-half level terms, PNL to HOL: from the logic of nominal sets to the logic of higher-order functions, Two-level nominal sets and semantic nominal terms: an extension of nominal set theory for handling meta-variables
