Murdoch James Gabbay
Orcid: 0000-0001-5796-3455
According to our database1,
Murdoch James Gabbay
authored at least 80 papers
between 1999 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
IACR Cryptol. ePrint Arch., 2024
CoRR, 2024
2023
2021
Proceedings of the 3rd International Workshop on Formal Methods for Blockchains, 2021
2020
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation: Applications, 2020
2018
Log. Methods Comput. Sci., 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
J. Log. Comput., 2015
Proceedings of the Tenth Workshop on Logical and Semantic Frameworks, with Applications, 2015
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
Proceedings of the HOWARD-60: A Festschrift on the Occasion of Howard Barringer's 60th Birthday, 2014
2013
Math. Struct. Comput. Sci., 2013
J. Appl. Log., 2013
2012
ACM Trans. Comput. Log., 2012
Theor. Comput. Sci., 2012
Finite and infinite support in nominal algebra and logic: nominal completeness theorems for free.
J. Symb. Log., 2012
J. Appl. Log., 2012
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
Proceedings of the 28th Conference on the Mathematical Foundations of Programming Semantics, 2012
Proceedings of the 28th Conference on the Mathematical Foundations of Programming Semantics, 2012
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
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
Proceedings of the Foundations of Software Science and Computational Structures, 2011
Proceedings of the Fundamentals of Computation Theory - 18th International Symposium, 2011
Proceedings of the Algebra and Coalgebra in Computer Science, 2011
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
Proceedings of the Proceedings 5th International Workshop on Logical Frameworks and Meta-languages: Theory and Practice, 2010
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
Theor. Comput. Sci., 2009
J. Log. 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
Proceedings of the 17th International Workshop on Functional and (Constraint) Logic Programming, 2008
Proceedings of the 17th International Workshop on Functional and (Constraint) Logic Programming, 2008
Proceedings of the Logic, 2008
Proceedings of the AISB 2008 Convention: Communication, 2008
2007
J. Appl. Log., 2007
Proceedings of the Second International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, 2007
Proceedings of the 16th International Workshop on Functional and (Constraint) Logic Programming, 2007
2006
Proceedings of the First International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, 2006
Proceedings of the Types for Proofs and Programs, International Workshop, 2006
2005
Proceedings of the 7th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2005
Proceedings of the 7th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2005
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
Proceedings of the 6th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2004
Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 2004
2003
Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming, 2003
Proceedings of the Computer Science Logic, 17th International Workshop, 2003
2002
Formal Aspects Comput., 2002
2000
Proceedings of the Mathematics of Program Construction, 5th International Conference, 2000
1999
Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, 1999