Murdoch James Gabbay

Orcid: 0000-0001-5796-3455

According to our database1, Murdoch James Gabbay authored at least 79 papers between 1999 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Semitopology: distributed collaborative action via topology, algebra, and logic.
CoRR, 2024

2023
Permissive-Nominal Logic (journal version).
CoRR, 2023

Semiframes: algebras of heterogeneous consensus.
CoRR, 2023

Semitopology: a new topological model of heterogeneous consensus.
CoRR, 2023

2021
Algebras of UTxO blockchains.
Math. Struct. Comput. Sci., 2021

Money Grows on (Proof-)Trees: The Formal FA1.2 Ledger Standard.
Proceedings of the 3rd International Workshop on Formal Methods for Blockchains, 2021

2020
Equivariant ZFA and the foundations of nominal techniques.
J. Log. Comput., 2020

Karl Marx and the Blockchain.
CoRR, 2020

What is an EUTxO blockchain?
CoRR, 2020

UTxO- vs Account-Based Smart Contract Blockchain Programming Paradigms.
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation: Applications, 2020

2018
The language of Stratified Sets is confluent and strongly normalising.
Log. Methods Comput. Sci., 2018

Equivariant ZFA with Choice: a position paper.
CoRR, 2018

2017
Representation and duality of the untyped λ-calculus in nominal lattice and topological semantics, with a proof of topological completeness.
Ann. Pure Appl. Log., 2017

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

2015
Quantifiers in logic and proof-search using permissive-nominal terms and sets.
J. Log. Comput., 2015

Checking Overlaps of Nominal Rewriting Rules.
Proceedings of the Tenth Workshop on Logical and Semantic Frameworks, with Applications, 2015

Leaving the Nest: Nominal Techniques for Variables with Interleaving Scopes.
Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

2014
A simple and complete model theory for intensional and extensional untyped lambda-equality.
FLAP, 2014

Consistency of Quine's New Foundations using nominal techniques.
CoRR, 2014

Stone duality for first-order logic: a nominal approach to logic and topology.
Proceedings of the HOWARD-60: A Festschrift on the Occasion of Howard Barringer's 60th Birthday, 2014

2013
Imaginary groups: lazy monoids and reversible computation.
Math. Struct. Comput. Sci., 2013

Denotation of contextual modal type theory (CMTT): Syntax and meta-programming.
J. Appl. Log., 2013

Representation and duality of the
CoRR, 2013

2012
Permissive-nominal logic: First-order logic over nominal terms and sets.
ACM Trans. Comput. Log., 2012

PNL to HOL: From the logic of nominal sets to the logic of higher-order functions.
Theor. Comput. Sci., 2012

Finite and infinite support in nominal algebra and logic: nominal completeness theorems for free.
J. Symb. Log., 2012

Unity in nominal equational reasoning: The algebra of equality on nominal sets.
J. Appl. Log., 2012

Meta-variables as infinite lists in nominal terms unification and rewriting.
Log. J. IGPL, 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].
Inf. Comput., 2012

Game Semantics in the Nominal Model.
Proceedings of the 28th Conference on the Mathematical Foundations of Programming Semantics, 2012

Nominal SOS.
Proceedings of the 28th Conference on the Mathematical Foundations of Programming Semantics, 2012

Denotation of syntax and metaprogramming in contextual modal type theory (CMTT)
CoRR, 2012

Nominal Semantics for Predicate Logic: Algebras, Substitution, Quantifiers, and Limits.
Proceedings of the 9th Italian Convention on Computational Logic, 2012

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

From nominal sets binding to functions and lambda-abstraction: connecting the logic of permutation models with the logic of functions.
CoRR, 2011

Nominal Henkin Semantics: simply-typed lambda-calculus models in nominal sets
Proceedings of the Proceedings Sixth International Workshop on Logical Frameworks and Meta-languages: Theory and Practice, 2011

Foundations of nominal techniques: logic and semantics of variables in abstract syntax.
Bull. Symb. Log., 2011

Freshness and Name-Restriction in Sets of Traces with Names.
Proceedings of the Foundations of Software Science and Computational Structures, 2011

Principal Types for Nominal Theories.
Proceedings of the Fundamentals of Computation Theory - 18th International Symposium, 2011

Stone Duality for Nominal Boolean Algebras with И.
Proceedings of the Algebra and Coalgebra in Computer Science, 2011

2010
A Nominal Axiomatization of the Lambda Calculus.
J. Log. Comput., 2010

Permissive nominal terms and their unification: an infinite, co-infinite approach to nominal techniques.
Log. J. IGPL, 2010

Curry-Howard for incomplete first-order logic derivations using one-and-a-half level terms.
Inf. Comput., 2010

Closed nominal rewriting and efficiently computable nominal algebra equality
Proceedings of the Proceedings 5th International Workshop on Logical Frameworks and Meta-languages: Theory and Practice, 2010

Permissive-nominal logic.
Proceedings of the 12th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2010

A Simple Class of Kripke-Style Models in Which Logic and Computation Have Equal Standing.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

2009
A study of substitution, using nominal techniques and Fraenkel-Mostowksi sets.
Theor. Comput. Sci., 2009

Nominal (Universal) Algebra: Equational Logic with Names and Binding.
J. Log. Comput., 2009

Nominal Algebra and the HSP Theorem.
J. Log. Comput., 2009

The lambda-context calculus (extended version).
Inf. Comput., 2009

Universal algebra over lambda-terms and nominal terms: the connection in logic between nominal techniques and higher-order variables.
Proceedings of the Fourth International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, 2009

2008
One-and-a-halfth-order Logic.
J. Log. Comput., 2008

Capture-avoiding substitution as a nominal algebra.
Formal Aspects Comput., 2008

Two-level Lambda-calculus.
Proceedings of the 17th International Workshop on Functional and (Constraint) Logic Programming, 2008

Term Sequent Logic.
Proceedings of the 17th International Workshop on Functional and (Constraint) Logic Programming, 2008

One-and-a-Halfth Order Terms: Curry-Howard and Incomplete Derivations.
Proceedings of the Logic, 2008

Nominal Renaming Sets.
Proceedings of the Logic for Programming, 2008

Substitution for Fraenkel-Mostowski foundations.
Proceedings of the AISB 2008 Convention: Communication, 2008

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

A general mathematics of names.
Inf. Comput., 2007

Nominal rewriting.
Inf. Comput., 2007

The lambda-context Calculus.
Proceedings of the Second International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, 2007

a-Logic With Arrows.
Proceedings of the 16th International Workshop on Functional and (Constraint) Logic Programming, 2007

A Formal Calculus for Informal Equality with Binding.
Proceedings of the Logic, 2007

2006
Hierarchical Nominal Terms and Their Theory of Rewriting.
Proceedings of the First International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, 2006

Curry-Style Types for Nominal Terms.
Proceedings of the Types for Proofs and Programs, International Workshop, 2006

2005
A new calculus of contexts.
Proceedings of the 7th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2005

Nominal rewriting with name generation: abstraction vs. locality.
Proceedings of the 7th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2005

SOS for Higher Order Processes.
Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005

a-logic.
Proceedings of the We Will Show Them! Essays in Honour of Dov Gabbay, Volume One, 2005

Some Formal Considerations on Gabbay's Restart Rule in Natural Deduction and Goal-Directed Reasoning.
Proceedings of the We Will Show Them! Essays in Honour of Dov Gabbay, Volume One, 2005

2004
Nominal unification.
Theor. Comput. Sci., 2004

Nominal rewriting systems.
Proceedings of the 6th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2004

A Sequent Calculus for Nominal Logic.
Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 2004

2003
FreshML: programming with binders made simple.
Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming, 2003

Nominal Unificaiton.
Proceedings of the Computer Science Logic, 17th International Workshop, 2003

2002
A New Approach to Abstract Syntax with Variable Binding.
Formal Aspects Comput., 2002

2000
A Metalanguage for Programming with Bound Names Modulo Renaming.
Proceedings of the Mathematics of Program Construction, 5th International Conference, 2000

1999
A New Approach to Abstract Syntax Involving Binders.
Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, 1999


  Loading...