A New Approach to Abstract Syntax Involving Binders. - Murdoch Gabbay; Andrew M. Pitts (LICS, 1999)

A Metalanguage for Programming with Bound Names Modulo Renaming. - Andrew M. Pitts; Murdoch Gabbay (MPC, 2000)

A New Approach to Abstract Syntax with Variable Binding. - Murdoch Gabbay; Andrew M. Pitts (Formal Aspects Comput., 2002)

Nominal Unificaiton. - Christian Urban; Andrew M. Pitts; Murdoch Gabbay (CSL, 2003)

FreshML: programming with binders made simple. - Mark R. Shinwell; Andrew M. Pitts; Murdoch Gabbay (ICFP, 2003)

A Sequent Calculus for Nominal Logic. - Murdoch Gabbay; James Cheney (LICS, 2004)

Nominal rewriting systems. - Maribel Fernández; Murdoch Gabbay; Ian Mackie (PPDP, 2004)

Nominal unification. - Christian Urban; Andrew M. Pitts; Murdoch Gabbay (Theor. Comput. Sci., 2004)

Some Formal Considerations on Gabbay's Restart Rule in Natural Deduction and Goal-Directed Reasoning. - Michael Gabbay 001; Murdoch Gabbay (We Will Show Them! (1), 2005)

a-logic. - Murdoch Gabbay; Michael Gabbay 001 (We Will Show Them! (1), 2005)

SOS for Higher Order Processes. - Mohammad Reza Mousavi 001; Murdoch Gabbay; Michel A. Reniers (CONCUR, 2005)

Nominal rewriting with name generation: abstraction vs. locality. - Maribel Fernández; Murdoch Gabbay (PPDP, 2005)

A new calculus of contexts. - Murdoch Gabbay (PPDP, 2005)

Curry-Style Types for Nominal Terms. - Maribel Fernández; Murdoch Gabbay (TYPES, 2006)

Hierarchical Nominal Terms and Their Theory of Rewriting. - Murdoch Gabbay (LFMTP@FLoC, 2006)

A Formal Calculus for Informal Equality with Binding. - Murdoch Gabbay; Aad Mathijssen (WoLLIC, 2007)

a-Logic With Arrows. - Murdoch Gabbay; Michael Gabbay 001 (WFLP@RDP, 2007)

The lambda-context Calculus. - Murdoch Gabbay; Stéphane Lengrand (LFMTP@CADE, 2007)

Nominal rewriting. - Maribel Fernández; Murdoch Gabbay (Inf. Comput., 2007)

A general mathematics of names. - Murdoch Gabbay (Inf. Comput., 2007)

Fresh Logic: proof-theory and semantics for FM and nominal techniques. - Murdoch Gabbay (J. Appl. Log., 2007)

Substitution for Fraenkel-Mostowski foundations. - Murdoch Gabbay; Michael Gabbay 001 (AISB Convention, 2008)

Nominal Renaming Sets. - Murdoch James Gabbay; Martin Hofmann 001 (LPAR, 2008)

One-and-a-Halfth Order Terms: Curry-Howard and Incomplete Derivations. - Murdoch Gabbay; Dominic P. Mulligan (WoLLIC, 2008)

Term Sequent Logic. - Michael Gabbay 001; Murdoch James Gabbay (WFLP, 2008)

Two-level Lambda-calculus. - Murdoch James Gabbay; Dominic P. Mulligan (WFLP, 2008)

Capture-avoiding substitution as a nominal algebra. - Murdoch James Gabbay; Aad Mathijssen (Formal Aspects Comput., 2008)

One-and-a-halfth-order Logic. - Murdoch James Gabbay; Aad Mathijssen (J. Log. Comput., 2008)

Universal algebra over lambda-terms and nominal terms: the connection in logic between nominal techniques and higher-order variables. - Murdoch James Gabbay; Dominic P. Mulligan (LFMTP, 2009)

The lambda-context calculus (extended version). - Murdoch James Gabbay; Stéphane Lengrand (Inf. Comput., 2009)

Nominal Algebra and the HSP Theorem. - Murdoch James Gabbay (J. Log. Comput., 2009)

Nominal (Universal) Algebra: Equational Logic with Names and Binding. - Murdoch James Gabbay; Aad Mathijssen (J. Log. Comput., 2009)

A study of substitution, using nominal techniques and Fraenkel-Mostowksi sets. - Murdoch James Gabbay (Theor. Comput. Sci., 2009)

A Simple Class of Kripke-Style Models in Which Logic and Computation Have Equal Standing. - Michael Gabbay 001; Murdoch James Gabbay (LPAR (Dakar), 2010)

Permissive-nominal logic. - Gilles Dowek; Murdoch James Gabbay (PPDP, 2010)

Closed nominal rewriting and efficiently computable nominal algebra equality - Maribel Fernández; Murdoch James Gabbay (LFMTP, 2010)

Curry-Howard for incomplete first-order logic derivations using one-and-a-half level terms. - Murdoch James Gabbay; Dominic P. Mulligan (Inf. Comput., 2010)

Permissive nominal terms and their unification: an infinite, co-infinite approach to nominal techniques. - Gilles Dowek; Murdoch James Gabbay; Dominic P. Mulligan (Log. J. IGPL, 2010)

A Nominal Axiomatization of the Lambda Calculus. - Murdoch James Gabbay; Aad Mathijssen (J. Log. Comput., 2010)

Stone Duality for Nominal Boolean Algebras with И. - Murdoch James Gabbay; Tadeusz Litak; Daniela Petrisan (CALCO, 2011)

Principal Types for Nominal Theories. - Elliot Fairweather; Maribel Fernández; Murdoch James Gabbay (FCT, 2011)

Freshness and Name-Restriction in Sets of Traces with Names. - Murdoch James Gabbay; Vincenzo Ciancia (FoSSaCS, 2011)

Foundations of nominal techniques: logic and semantics of variables in abstract syntax. - Murdoch James Gabbay (Bull. Symb. Log., 2011)

Nominal Henkin Semantics: simply-typed lambda-calculus models in nominal sets - Murdoch James Gabbay; Dominic P. Mulligan (LFMTP, 2011)

From nominal sets binding to functions and lambda-abstraction: connecting the logic of permutation models with the logic of functions. - Gilles Dowek; Murdoch Gabbay (CoRR, 2011)

Two-level nominal sets and semantic nominal terms: an extension of nominal set theory for handling meta-variables. - Murdoch James Gabbay (Math. Struct. Comput. Sci., 2011)

Nominal Semantics for Predicate Logic: Algebras, Substitution, Quantifiers, and Limits. - Gilles Dowek; Murdoch James Gabbay (CILC, 2012)

Denotation of syntax and metaprogramming in contextual modal type theory (CMTT) - Murdoch Gabbay; Aleksandar Nanevski (CoRR, 2012)

Nominal SOS. - Matteo Cimini; Mohammad Reza Mousavi 001; Michel A. Reniers; Murdoch James Gabbay (MFPS, 2012)

Game Semantics in the Nominal Model. - Murdoch Gabbay; Dan R. Ghica (MFPS, 2012)

Corrigendum to "Curry-Howard for incomplete first-order logic derivations using one-and-a-half level terms" [Inf.Comput.208(3)(2010) 230-258]. - Murdoch James Gabbay; Dominic P. Mulligan (Inf. Comput., 2012)

Meta-variables as infinite lists in nominal terms unification and rewriting. - Murdoch James Gabbay (Log. J. IGPL, 2012)

Unity in nominal equational reasoning: The algebra of equality on nominal sets. - Murdoch James Gabbay (J. Appl. Log., 2012)

Finite and infinite support in nominal algebra and logic: nominal completeness theorems for free. - Murdoch James Gabbay (J. Symb. Log., 2012)

PNL to HOL: From the logic of nominal sets to the logic of higher-order functions. - Gilles Dowek; Murdoch James Gabbay (Theor. Comput. Sci., 2012)

Permissive-nominal logic: First-order logic over nominal terms and sets. - Gilles Dowek; Murdoch James Gabbay (ACM Trans. Comput. Log., 2012)

Representation and duality of the - Murdoch James Gabbay; Michael Gabbay 001 (CoRR, 2013)

Denotation of contextual modal type theory (CMTT): Syntax and meta-programming. - Murdoch James Gabbay; Aleksandar Nanevski (J. Appl. Log., 2013)

Imaginary groups: lazy monoids and reversible computation. - Murdoch James Gabbay; Peter H. Kropholler (Math. Struct. Comput. Sci., 2013)

Stone duality for first-order logic: a nominal approach to logic and topology. - Murdoch James Gabbay (HOWARD-60, 2014)

Consistency of Quine's New Foundations using nominal techniques. - Murdoch James Gabbay (CoRR, 2014)

A simple and complete model theory for intensional and extensional untyped lambda-equality. - Michael Gabbay 001; Murdoch Gabbay (FLAP, 2014)

Leaving the Nest: Nominal Techniques for Variables with Interleaving Scopes. - Murdoch James Gabbay; Dan R. Ghica; Daniela Petrisan (CSL, 2015)

Checking Overlaps of Nominal Rewriting Rules. - Mauricio Ayala-Rincón; Maribel Fernández; Murdoch James Gabbay; Ana Cristina Rocha Oliveira (LSFA, 2015)

Quantifiers in logic and proof-search using permissive-nominal terms and sets. - Murdoch James Gabbay; Claus-Peter Wirth (J. Log. Comput., 2015)

Semantics Out of Context: Nominal Absolute Denotations for First-Order Logic and Computation. - Murdoch James Gabbay (J. ACM, 2016)

Representation and duality of the untyped λ-calculus in nominal lattice and topological semantics, with a proof of topological completeness. - Murdoch James Gabbay; Michael Gabbay 001 (Ann. Pure Appl. Log., 2017)

Equivariant ZFA with Choice: a position paper. - Murdoch James Gabbay (CoRR, 2018)

The language of Stratified Sets is confluent and strongly normalising. - Murdoch James Gabbay (Log. Methods Comput. Sci., 2018)

UTxO- vs Account-Based Smart Contract Blockchain Programming Paradigms. - Lars Brünjes; Murdoch James Gabbay (ISoLA (3), 2020)

What is an EUTxO blockchain? - Murdoch James Gabbay (CoRR, 2020)

Karl Marx and the Blockchain. - Devraj Basu; Murdoch Gabbay (CoRR, 2020)

Equivariant ZFA and the foundations of nominal techniques. - Murdoch Gabbay (J. Log. Comput., 2020)

Money Grows on (Proof-)Trees: The Formal FA1.2 Ledger Standard. - Murdoch James Gabbay; Arvid Jakobsson; Kristina Sojakova (FMBC@CAV, 2021)

Algebras of UTxO blockchains. - Murdoch James Gabbay (Math. Struct. Comput. Sci., 2021)

Semitopology: a new topological model of heterogeneous consensus. - Murdoch Gabbay; Giuliano Losa (CoRR, 2023)

Semiframes: algebras of heterogeneous consensus. - Murdoch Gabbay; Giuliano Losa (CoRR, 2023)

Permissive-Nominal Logic (journal version). - Gilles Dowek; Murdoch James Gabbay (CoRR, 2023)

Semitopology: distributed collaborative action via topology, algebra, and logic. - Murdoch James Gabbay; Giuliano Losa (CoRR, 2024)

Arithmetisation of computation via polynomial semantics for first-order logic. - Murdoch James Gabbay (IACR Cryptol. ePrint Arch., 2024)

Semitopology: a topological approach to decentralized collaborative action. - Murdoch James Gabbay (J. Log. Comput., 2025)

A declarative approach to specifying distributed algorithms using three-valued modal logic. - Murdoch James Gabbay; Luca Zanolini (CoRR, 2025)

Decentralised collaborative action: cryptoeconomics in space. - Murdoch James Gabbay (CoRR, 2025)