Murdoch Gabbay
Murdoch Gabbay
Lecturer in Computer Science at Heriot-Watt University, Edinburgh, UK
Verifierad e-postadress på - Startsida
TitelCiteras avÅr
A new approach to abstract syntax with variable binding
MJ Gabbay, AM Pitts
Formal aspects of computing 13 (3-5), 341-363, 2002
A new approach to abstract syntax involving binders
M Gabbay, A Pitts
Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158 …, 1999
Nominal unification
C Urban, AM Pitts, MJ Gabbay
Theoretical Computer Science 323 (1-3), 473-497, 2004
FreshML: Programming with binders made simple
MR Shinwell, AM Pitts, MJ Gabbay
Proceedings of the eighth ACM SIGPLAN international conference on Functional …, 2003
A metalanguage for programming with bound names modulo renaming
AM Pitts, MJ Gabbay
International Conference on Mathematics of Program Construction, 230-255, 2000
Nominal rewriting
M Fernández, MJ Gabbay
Information and Computation 205 (6), 917-965, 2007
A theory of inductive definitions with α-equivalence: semantics, implementation, programming language
MJ Gabbay
University of Cambridge, 2001
Nominal (universal) algebra: equational logic with names and binding
MJ Gabbay, A Mathijssen
Journal of Logic and Computation 19 (6), 1455-1508, 2009
Nominal rewriting systems
M Fernández, MJ Gabbay, I Mackie
Proceedings of the 6th ACM SIGPLAN international conference on Principles …, 2004
One-and-a-halfth-order logic
MJ Gabbay, A Mathijssen
Journal of Logic and Computation 18 (4), 521-562, 2008
Nominal unification
C Urban, A Pitts, M Gabbay
International Workshop on Computer Science Logic, 513-527, 2003
Foundations of nominal techniques: logic and semantics of variables in abstract syntax
MJ Gabbay
Bulletin of Symbolic Logic 17 (2), 161-229, 2011
Capture-avoiding substitution as a nominal algebra
MJ Gabbay, A Mathijssen
Formal Aspects of Computing 20 (4-5), 451-479, 2008
A sequent calculus for nominal logic
M Gabbay, J Cheney
Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science …, 2004
Freshness and name-restriction in sets of traces with names
MJ Gabbay, V Ciancia
International Conference on Foundations of Software Science and …, 2011
The π-calculus in FM
MJ Gabbay
Thirty Five Years of Automating Mathematics, 247-269, 2003
A general mathematics of names
MJ Gabbay
Information and Computation 205 (7), 982-1011, 2007
A formal calculus for informal equality with binding
MJ Gabbay, A Mathijssen
International Workshop on Logic, Language, Information, and Computation, 162-176, 2007
Fresh logic: proof-theory and semantics for FM and nominal techniques
MJ Gabbay
Journal of Applied Logic 5 (2), 356-387, 2007
Permissive nominal terms and their unification: an infinite, co-infinite approach to nominal techniques
G Dowek, MJ Gabbay, DP Mulligan
Logic Journal of IGPL 18 (6), 769-822, 2010
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20