default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMurdoch James Gabbay
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i21]Murdoch James Gabbay, Giuliano Losa:
Semitopology: distributed collaborative action via topology, algebra, and logic. CoRR abs/2402.03253 (2024)- [i20]Murdoch James Gabbay:
Arithmetisation of computation via polynomial semantics for first-order logic. IACR Cryptol. ePrint Arch. 2024: 954 (2024) - 2023
- [i19]Murdoch Gabbay, Giuliano Losa:
Semitopology: a new topological model of heterogeneous consensus. CoRR abs/2303.09287 (2023) - [i18]Murdoch Gabbay, Giuliano Losa:
Semiframes: algebras of heterogeneous consensus. CoRR abs/2310.00956 (2023) - [i17]Gilles Dowek, Murdoch James Gabbay, Dominic P. Mulligan:
Permissive nominal terms and their unification: an infinite, co-infinite approach to nominal techniques. CoRR abs/2312.15651 (2023) - [i16]Gilles Dowek, Murdoch James Gabbay:
PNL to HOL: from the logic of nominal sets to the logic of higher-order functions. CoRR abs/2312.16239 (2023) - [i15]Gilles Dowek, Murdoch James Gabbay:
Permissive-Nominal Logic (journal version). CoRR abs/2312.16480 (2023) - [i14]Gilles Dowek, Murdoch James Gabbay:
Nominal semantics for predicate logic: algebras, substitution, quantifiers, and limits. CoRR abs/2312.16487 (2023) - 2021
- [j31]Murdoch James Gabbay
:
Algebras of UTxO blockchains. Math. Struct. Comput. Sci. 31(9): 1034-1089 (2021) - [c38]Murdoch James Gabbay, Arvid Jakobsson, Kristina Sojakova:
Money Grows on (Proof-)Trees: The Formal FA1.2 Ledger Standard. FMBC@CAV 2021: 2:1-2:14 - [i13]Murdoch Gabbay, Arvid Jakobsson, Kristina Sojakova:
Money grows on (proof-)trees: the formal FA1.2 ledger standard. CoRR abs/2109.09451 (2021) - 2020
- [j30]Murdoch Gabbay:
Equivariant ZFA and the foundations of nominal techniques. J. Log. Comput. 30(2): 525-548 (2020) - [c37]Lars Brünjes, Murdoch James Gabbay:
UTxO- vs Account-Based Smart Contract Blockchain Programming Paradigms. ISoLA (3) 2020: 73-88 - [i12]Lars Brünjes, Murdoch James Gabbay:
UTxO- vs account-based smart contract blockchain programming paradigms. CoRR abs/2003.14271 (2020) - [i11]Murdoch James Gabbay:
What is an EUTxO blockchain? CoRR abs/2007.12404 (2020) - [i10]Devraj Basu, Murdoch Gabbay:
Karl Marx and the Blockchain. CoRR abs/2007.13346 (2020)
2010 – 2019
- 2018
- [j29]Murdoch James Gabbay:
The language of Stratified Sets is confluent and strongly normalising. Log. Methods Comput. Sci. 14(2) (2018) - [i9]Murdoch James Gabbay:
Equivariant ZFA and the foundations of nominal techniques. CoRR abs/1801.09443 (2018) - [i8]Murdoch James Gabbay:
Equivariant ZFA with Choice: a position paper. CoRR abs/1803.08727 (2018) - 2017
- [j28]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): 501-621 (2017) - [i7]Murdoch James Gabbay:
The language of Stratified Sets is confluent and strongly normalising. CoRR abs/1705.07767 (2017) - 2016
- [j27]Murdoch James Gabbay:
Semantics Out of Context: Nominal Absolute Denotations for First-Order Logic and Computation. J. ACM 63(3): 25:1-25:66 (2016) - 2015
- [j26]Murdoch James Gabbay, Claus-Peter Wirth:
Quantifiers in logic and proof-search using permissive-nominal terms and sets. J. Log. Comput. 25(2): 473-523 (2015) - [c36]Murdoch James Gabbay, Dan R. Ghica, Daniela Petrisan:
Leaving the Nest: Nominal Techniques for Variables with Interleaving Scopes. CSL 2015: 374-389 - [c35]Mauricio Ayala-Rincón, Maribel Fernández, Murdoch James Gabbay, Ana Cristina Rocha Oliveira:
Checking Overlaps of Nominal Rewriting Rules. LSFA 2015: 39-56 - 2014
- [j25]Michael Gabbay, Murdoch Gabbay:
A simple and complete model theory for intensional and extensional untyped lambda-equality. FLAP 1(2): 83-106 (2014) - [p1]Murdoch James Gabbay:
Stone duality for first-order logic: a nominal approach to logic and topology. HOWARD-60 2014: 178-209 - [i6]Murdoch James Gabbay:
Consistency of Quine's New Foundations using nominal techniques. CoRR abs/1406.4060 (2014) - 2013
- [j24]Murdoch James Gabbay, Aleksandar Nanevski:
Denotation of contextual modal type theory (CMTT): Syntax and meta-programming. J. Appl. Log. 11(1): 1-29 (2013) - [j23]Murdoch James Gabbay, Peter H. Kropholler:
Imaginary groups: lazy monoids and reversible computation. Math. Struct. Comput. Sci. 23(5): 1002-1031 (2013) - [i5]Murdoch James Gabbay, Michael Gabbay:
Representation and duality of the. CoRR abs/1305.5968 (2013) - [i4]Murdoch James Gabbay:
Semantics out of context: nominal absolute denotations for first-order logic and computation. CoRR abs/1305.6291 (2013) - 2012
- [j22]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: 119 (2012) - [j21]Murdoch James Gabbay:
Meta-variables as infinite lists in nominal terms unification and rewriting. Log. J. IGPL 20(6): 967-1000 (2012) - [j20]Murdoch James Gabbay:
Unity in nominal equational reasoning: The algebra of equality on nominal sets. J. Appl. Log. 10(2): 199-217 (2012) - [j19]Murdoch James Gabbay:
Finite and infinite support in nominal algebra and logic: nominal completeness theorems for free. J. Symb. Log. 77(3): 828-852 (2012) - [j18]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: 38-69 (2012) - [j17]Gilles Dowek, Murdoch James Gabbay:
Permissive-nominal logic: First-order logic over nominal terms and sets. ACM Trans. Comput. Log. 13(3): 20:1-20:36 (2012) - [c34]Gilles Dowek, Murdoch James Gabbay:
Nominal Semantics for Predicate Logic: Algebras, Substitution, Quantifiers, and Limits. CILC 2012: 104-118 - [c33]Matteo Cimini, Mohammad Reza Mousavi, Michel A. Reniers, Murdoch James Gabbay:
Nominal SOS. MFPS 2012: 103-116 - [c32]Murdoch Gabbay, Dan R. Ghica:
Game Semantics in the Nominal Model. MFPS 2012: 173-189 - [i3]Murdoch Gabbay, Aleksandar Nanevski:
Denotation of syntax and metaprogramming in contextual modal type theory (CMTT). CoRR abs/1202.0904 (2012) - 2011
- [j16]Murdoch James Gabbay:
Foundations of nominal techniques: logic and semantics of variables in abstract syntax. Bull. Symb. Log. 17(2): 161-229 (2011) - [j15]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): 997-1033 (2011) - [c31]Murdoch James Gabbay, Tadeusz Litak, Daniela Petrisan:
Stone Duality for Nominal Boolean Algebras with И. CALCO 2011: 192-207 - [c30]Elliot Fairweather, Maribel Fernández, Murdoch James Gabbay:
Principal Types for Nominal Theories. FCT 2011: 160-172 - [c29]Murdoch James Gabbay, Vincenzo Ciancia:
Freshness and Name-Restriction in Sets of Traces with Names. FoSSaCS 2011: 365-380 - [c28]Murdoch James Gabbay, Dominic P. Mulligan:
Nominal Henkin Semantics: simply-typed lambda-calculus models in nominal sets. LFMTP 2011: 58-75 - [i2]Gilles Dowek, Murdoch Gabbay:
From nominal sets binding to functions and lambda-abstraction: connecting the logic of permutation models with the logic of functions. CoRR abs/1111.4611 (2011) - [i1]Murdoch James Gabbay:
Finite and infinite support in nominal algebra and logic: nominal completeness theorems for free. CoRR abs/1112.0923 (2011) - 2010
- [j14]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): 230-258 (2010) - [j13]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): 769-822 (2010) - [j12]Murdoch James Gabbay, Aad Mathijssen:
A Nominal Axiomatization of the Lambda Calculus. J. Log. Comput. 20(2): 501-531 (2010) - [c27]Michael Gabbay, Murdoch James Gabbay:
A Simple Class of Kripke-Style Models in Which Logic and Computation Have Equal Standing. LPAR (Dakar) 2010: 231-254 - [c26]Gilles Dowek, Murdoch James Gabbay:
Permissive-nominal logic. PPDP 2010: 165-176 - [c25]Maribel Fernández, Murdoch James Gabbay:
Closed nominal rewriting and efficiently computable nominal algebra equality. LFMTP 2010: 37-51
2000 – 2009
- 2009
- [j11]Murdoch James Gabbay, Stéphane Lengrand:
The lambda-context calculus (extended version). Inf. Comput. 207(12): 1369-1400 (2009) - [j10]Murdoch James Gabbay:
Nominal Algebra and the HSP Theorem. J. Log. Comput. 19(2): 341-367 (2009) - [j9]Murdoch James Gabbay, Aad Mathijssen:
Nominal (Universal) Algebra: Equational Logic with Names and Binding. J. Log. Comput. 19(6): 1455-1508 (2009) - [j8]Murdoch James Gabbay:
A study of substitution, using nominal techniques and Fraenkel-Mostowksi sets. Theor. Comput. Sci. 410(12-13): 1159-1189 (2009) - [c24]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: 64-73 - 2008
- [j7]Murdoch James Gabbay, Aad Mathijssen:
Capture-avoiding substitution as a nominal algebra. Formal Aspects Comput. 20(4-5): 451-479 (2008) - [j6]Murdoch James Gabbay, Aad Mathijssen:
One-and-a-halfth-order Logic. J. Log. Comput. 18(4): 521-562 (2008) - [c23]Murdoch Gabbay, Michael Gabbay:
Substitution for Fraenkel-Mostowski foundations. AISB Convention 2008: 65-72 - [c22]Murdoch James Gabbay, Martin Hofmann:
Nominal Renaming Sets. LPAR 2008: 158-173 - [c21]Murdoch Gabbay, Dominic P. Mulligan:
One-and-a-Halfth Order Terms: Curry-Howard and Incomplete Derivations. WoLLIC 2008: 179-193 - [c20]Michael Gabbay, Murdoch James Gabbay:
Term Sequent Logic. WFLP 2008: 87-106 - [c19]Murdoch James Gabbay, Dominic P. Mulligan:
Two-level Lambda-calculus. WFLP 2008: 107-129 - 2007
- [j5]Maribel Fernández, Murdoch Gabbay:
Nominal rewriting. Inf. Comput. 205(6): 917-965 (2007) - [j4]Murdoch Gabbay:
A general mathematics of names. Inf. Comput. 205(7): 982-1011 (2007) - [j3]Murdoch Gabbay:
Fresh Logic: proof-theory and semantics for FM and nominal techniques. J. Appl. Log. 5(2): 356-387 (2007) - [c18]Murdoch Gabbay, Aad Mathijssen:
A Formal Calculus for Informal Equality with Binding. WoLLIC 2007: 162-176 - [c17]Murdoch Gabbay, Michael Gabbay:
a-Logic With Arrows. WFLP@RDP 2007: 3-29 - [c16]Murdoch Gabbay, Stéphane Lengrand:
The lambda-context Calculus. LFMTP@CADE 2007: 19-35 - 2006
- [c15]Murdoch Gabbay, Aad Mathijssen:
Capture-Avoiding Substitution as a Nominal Algebra. ICTAC 2006: 198-212 - [c14]Murdoch Gabbay, Aad Mathijssen:
One-and-a-halfth-order logic. PPDP 2006: 189-200 - [c13]Maribel Fernández, Murdoch Gabbay:
Curry-Style Types for Nominal Terms. TYPES 2006: 125-139 - [c12]Murdoch Gabbay:
Hierarchical Nominal Terms and Their Theory of Rewriting. LFMTP@FLoC 2006: 37-52 - 2005
- [c11]Michael Gabbay, Murdoch Gabbay:
Some Formal Considerations on Gabbay's Restart Rule in Natural Deduction and Goal-Directed Reasoning. We Will Show Them! (1) 2005: 701-730 - [c10]Murdoch Gabbay, Michael Gabbay:
a-logic. We Will Show Them! (1) 2005: 731-764 - [c9]Mohammad Reza Mousavi, Murdoch Gabbay, Michel A. Reniers:
SOS for Higher Order Processes. CONCUR 2005: 308-322 - [c8]Maribel Fernández, Murdoch Gabbay:
Nominal rewriting with name generation: abstraction vs. locality. PPDP 2005: 47-58 - [c7]Murdoch Gabbay:
A new calculus of contexts. PPDP 2005: 94-105 - 2004
- [j2]Christian Urban, Andrew M. Pitts, Murdoch Gabbay:
Nominal unification. Theor. Comput. Sci. 323(1-3): 473-497 (2004) - [c6]Murdoch Gabbay, James Cheney:
A Sequent Calculus for Nominal Logic. LICS 2004: 139-148 - [c5]Maribel Fernández, Murdoch Gabbay, Ian Mackie:
Nominal rewriting systems. PPDP 2004: 108-119 - 2003
- [c4]Christian Urban, Andrew M. Pitts, Murdoch Gabbay:
Nominal Unificaiton. CSL 2003: 513-527 - [c3]Mark R. Shinwell, Andrew M. Pitts, Murdoch Gabbay:
FreshML: programming with binders made simple. ICFP 2003: 263-274 - 2002
- [j1]Murdoch Gabbay, Andrew M. Pitts:
A New Approach to Abstract Syntax with Variable Binding. Formal Aspects Comput. 13(3-5): 341-363 (2002) - 2000
- [c2]Andrew M. Pitts, Murdoch Gabbay:
A Metalanguage for Programming with Bound Names Modulo Renaming. MPC 2000: 230-255
1990 – 1999
- 1999
- [c1]Murdoch Gabbay, Andrew M. Pitts:
A New Approach to Abstract Syntax Involving Binders. LICS 1999: 214-224
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-02 21:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
