Murdoch James Gabbay

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 17

Top Topics

Programming Paradigms

Highly Expressive

Predicate Logic

Top Venues

Math. Struct. Comput. Sci.

J. Log. Comput.

Publications

Murdoch James Gabbay
Arithmetisation of computation via polynomial semantics for first-order logic. IACR Cryptol. ePrint Arch. 2024 (2024)
Murdoch James Gabbay, Giuliano Losa
Semitopology: distributed collaborative action via topology, algebra, and logic. CoRR (2024)
Gilles Dowek, Murdoch James Gabbay, Dominic P. Mulligan
Permissive nominal terms and their unification: an infinite, co-infinite approach to nominal techniques. CoRR (2023)
Gilles Dowek, Murdoch James Gabbay
Nominal semantics for predicate logic: algebras, substitution, quantifiers, and limits. CoRR (2023)
Gilles Dowek, Murdoch James Gabbay
Permissive-Nominal Logic (journal version). CoRR (2023)
Gilles Dowek, Murdoch James Gabbay
PNL to HOL: from the logic of nominal sets to the logic of higher-order functions. CoRR (2023)
Murdoch James Gabbay, Arvid Jakobsson, Kristina Sojakova
Money Grows on (Proof-)Trees: The Formal FA1.2 Ledger Standard. FMBC@CAV (2021)
Murdoch James Gabbay
Algebras of UTxO blockchains. Math. Struct. Comput. Sci. 31 (9) (2021)
Murdoch James Gabbay
What is an EUTxO blockchain? CoRR (2020)
Lars Brünjes, Murdoch James Gabbay
UTxO- vs account-based smart contract blockchain programming paradigms. CoRR (2020)
Lars Brünjes, Murdoch James Gabbay
UTxO- vs Account-Based Smart Contract Blockchain Programming Paradigms. ISoLA (3) (2020)
Murdoch James Gabbay
Equivariant ZFA and the foundations of nominal techniques. CoRR (2018)
Murdoch James Gabbay
Equivariant ZFA with Choice: a position paper. CoRR (2018)
Murdoch James Gabbay
The language of Stratified Sets is confluent and strongly normalising. Log. Methods Comput. Sci. 14 (2) (2018)
Murdoch James Gabbay, Michael Gabbay
Representation and duality of the untyped λ-calculus in nominal lattice and topological semantics, with a proof of topological completeness. Ann. Pure Appl. Log. 168 (3) (2017)
Murdoch James Gabbay
The language of Stratified Sets is confluent and strongly normalising. CoRR (2017)
Murdoch James Gabbay
Semantics Out of Context: Nominal Absolute Denotations for First-Order Logic and Computation. J. ACM 63 (3) (2016)
Murdoch James Gabbay, Dan R. Ghica, Daniela Petrisan
Leaving the Nest: Nominal Techniques for Variables with Interleaving Scopes. CSL (2015)
Mauricio Ayala-Rincón, Maribel Fernández, Murdoch James Gabbay, Ana Cristina Rocha Oliveira
Checking Overlaps of Nominal Rewriting Rules. LSFA (2015)
Murdoch James Gabbay, Claus-Peter Wirth
Quantifiers in logic and proof-search using permissive-nominal terms and sets. J. Log. Comput. 25 (2) (2015)
Murdoch James Gabbay
Consistency of Quine's New Foundations using nominal techniques. CoRR (2014)
Murdoch James Gabbay
Semantics out of context: nominal absolute denotations for first-order logic and computation CoRR (2013)
Murdoch James Gabbay, Peter H. Kropholler
Imaginary groups: lazy monoids and reversible computation. Math. Struct. Comput. Sci. 23 (5) (2013)
Murdoch James Gabbay, Michael Gabbay
Representation and duality of the CoRR (2013)
Murdoch James Gabbay, Aleksandar Nanevski
Denotation of contextual modal type theory (CMTT): Syntax and meta-programming. J. Appl. Log. 11 (1) (2013)
Gilles Dowek, Murdoch James Gabbay
PNL to HOL: From the logic of nominal sets to the logic of higher-order functions. Theor. Comput. Sci. 451 (2012)
Murdoch James Gabbay
Unity in nominal equational reasoning: The algebra of equality on nominal sets. J. Appl. Log. 10 (2) (2012)
Murdoch James Gabbay
Meta-variables as infinite lists in nominal terms unification and rewriting. Log. J. IGPL 20 (6) (2012)
Gilles Dowek, Murdoch James Gabbay
Nominal Semantics for Predicate Logic: Algebras, Substitution, Quantifiers, and Limits. CILC (2012)
Murdoch James Gabbay, Dominic P. Mulligan
Corrigendum to "Curry-Howard for incomplete first-order logic derivations using one-and-a-half level terms" [Inf.Comput.208(3)(2010) 230-258]. Inf. Comput. 212 (2012)
Murdoch James Gabbay
Finite and infinite support in nominal algebra and logic: nominal completeness theorems for free. J. Symb. Log. 77 (3) (2012)
Gilles Dowek, Murdoch James Gabbay
Permissive-nominal logic: First-order logic over nominal terms and sets. ACM Trans. Comput. Log. 13 (3) (2012)
Matteo Cimini, Mohammad Reza Mousavi, Michel A. Reniers, Murdoch James Gabbay
Nominal SOS. MFPS (2012)
Murdoch James Gabbay
Two-level nominal sets and semantic nominal terms: an extension of nominal set theory for handling meta-variables. Math. Struct. Comput. Sci. 21 (5) (2011)
Murdoch James Gabbay, Vincenzo Ciancia
Freshness and Name-Restriction in Sets of Traces with Names. FoSSaCS (2011)
Murdoch James Gabbay, Tadeusz Litak, Daniela Petrisan
Stone Duality for Nominal Boolean Algebras with И. CALCO (2011)
Murdoch James Gabbay
Finite and infinite support in nominal algebra and logic: nominal completeness theorems for free CoRR (2011)
Murdoch James Gabbay, Dominic P. Mulligan
Nominal Henkin Semantics: simply-typed lambda-calculus models in nominal sets LFMTP (2011)
Elliot Fairweather, Maribel Fernández, Murdoch James Gabbay
Principal Types for Nominal Theories. FCT (2011)
Murdoch James Gabbay
Foundations of nominal techniques: logic and semantics of variables in abstract syntax. Bull. Symb. Log. 17 (2) (2011)
Murdoch James Gabbay, Dominic P. Mulligan
Curry-Howard for incomplete first-order logic derivations using one-and-a-half level terms. Inf. Comput. 208 (3) (2010)
Gilles Dowek, Murdoch James Gabbay, Dominic P. Mulligan
Permissive nominal terms and their unification: an infinite, co-infinite approach to nominal techniques. Log. J. IGPL 18 (6) (2010)
Michael Gabbay, Murdoch James Gabbay
A Simple Class of Kripke-Style Models in Which Logic and Computation Have Equal Standing. LPAR (Dakar) (2010)
Maribel Fernández, Murdoch James Gabbay
Closed nominal rewriting and efficiently computable nominal algebra equality LFMTP (2010)
Murdoch James Gabbay, Aad Mathijssen
A Nominal Axiomatization of the Lambda Calculus. J. Log. Comput. 20 (2) (2010)
Gilles Dowek, Murdoch James Gabbay
Permissive-nominal logic. PPDP (2010)
Murdoch James Gabbay, Aad Mathijssen
Nominal (Universal) Algebra: Equational Logic with Names and Binding. J. Log. Comput. 19 (6) (2009)
Michael Gabbay, Murdoch James Gabbay
Term Sequent Logic. Electron. Notes Theor. Comput. Sci. 246 (2009)
Murdoch James Gabbay
Nominal Algebra and the HSP Theorem. J. Log. Comput. 19 (2) (2009)
Murdoch James Gabbay, Dominic P. Mulligan
Two-level Lambda-calculus. Electron. Notes Theor. Comput. Sci. 246 (2009)
Murdoch James Gabbay, Stéphane Lengrand
The lambda-context calculus (extended version). Inf. Comput. 207 (12) (2009)
Murdoch James Gabbay
A study of substitution, using nominal techniques and Fraenkel-Mostowksi sets. Theor. Comput. Sci. 410 (12-13) (2009)
Murdoch James Gabbay, Dominic P. Mulligan
Universal algebra over lambda-terms and nominal terms: the connection in logic between nominal techniques and higher-order variables. LFMTP (2009)
Murdoch James Gabbay, Martin Hofmann
Nominal Renaming Sets. LPAR (2008)
Murdoch James Gabbay, Aad Mathijssen
One-and-a-halfth-order Logic. J. Log. Comput. 18 (4) (2008)
Murdoch James Gabbay, Aad Mathijssen
Capture-avoiding substitution as a nominal algebra. Formal Aspects Comput. 20 (4-5) (2008)
Andrew M. Pitts, Murdoch James Gabbay, Mark R. Shinwell
FreshML: programming with binders made simple. SIGPLAN Notices (2003)