2009 |
29 | EE | Murdoch James Gabbay:
A study of substitution, using nominal techniques and Fraenkel-Mostowksi sets.
Theor. Comput. Sci. 410(12-13): 1159-1189 (2009) |
2008 |
28 | EE | Murdoch Gabbay,
Michael Gabbay:
Substitution for Fraenkel-Mostowski foundations.
AISB Convention 2008: 65-72 |
27 | EE | Murdoch James Gabbay,
Martin Hofmann:
Nominal Renaming Sets.
LPAR 2008: 158-173 |
26 | EE | Murdoch Gabbay,
Dominic P. Mulligan:
One-and-a-Halfth Order Terms: Curry-Howard and Incomplete Derivations.
WoLLIC 2008: 179-193 |
25 | EE | Murdoch Gabbay,
Stéphane Lengrand:
The lambda-context Calculus.
Electr. Notes Theor. Comput. Sci. 196: 19-35 (2008) |
24 | EE | Murdoch Gabbay,
Michael Gabbay:
a-Logic With Arrows.
Electr. Notes Theor. Comput. Sci. 216: 3-29 (2008) |
23 | EE | Murdoch James Gabbay,
Aad Mathijssen:
Capture-avoiding substitution as a nominal algebra.
Formal Asp. Comput. 20(4-5): 451-479 (2008) |
22 | EE | Murdoch James Gabbay,
Aad Mathijssen:
One-and-a-halfth-order Logic.
J. Log. Comput. 18(4): 521-562 (2008) |
2007 |
21 | EE | Murdoch Gabbay,
Aad Mathijssen:
A Formal Calculus for Informal Equality with Binding.
WoLLIC 2007: 162-176 |
20 | EE | Murdoch Gabbay:
Hierarchical Nominal Terms and Their Theory of Rewriting.
Electr. Notes Theor. Comput. Sci. 174(5): 37-52 (2007) |
19 | EE | Maribel Fernández,
Murdoch Gabbay:
Nominal rewriting.
Inf. Comput. 205(6): 917-965 (2007) |
18 | EE | Murdoch Gabbay:
A general mathematics of names.
Inf. Comput. 205(7): 982-1011 (2007) |
17 | EE | Murdoch Gabbay:
Fresh Logic: proof-theory and semantics for FM and nominal techniques.
J. Applied Logic 5(2): 356-387 (2007) |
2006 |
16 | EE | Murdoch Gabbay,
Aad Mathijssen:
Capture-Avoiding Substitution as a Nominal Algebra.
ICTAC 2006: 198-212 |
15 | EE | Murdoch Gabbay,
Aad Mathijssen:
One-and-a-halfth-order logic.
PPDP 2006: 189-200 |
14 | EE | Maribel Fernández,
Murdoch Gabbay:
Curry-Style Types for Nominal Terms.
TYPES 2006: 125-139 |
2005 |
13 | EE | Mohammad Reza Mousavi,
Murdoch Gabbay,
Michel A. Reniers:
SOS for Higher Order Processes.
CONCUR 2005: 308-322 |
12 | EE | Maribel Fernández,
Murdoch Gabbay:
Nominal rewriting with name generation: abstraction vs. locality.
PPDP 2005: 47-58 |
11 | EE | Murdoch Gabbay:
A new calculus of contexts.
PPDP 2005: 94-105 |
10 | | 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 |
9 | | Murdoch Gabbay,
Michael Gabbay:
a-logic.
We Will Show Them! (1) 2005: 731-764 |
2004 |
8 | EE | Murdoch Gabbay,
James Cheney:
A Sequent Calculus for Nominal Logic.
LICS 2004: 139-148 |
7 | EE | Maribel Fernández,
Murdoch Gabbay,
Ian Mackie:
Nominal rewriting systems.
PPDP 2004: 108-119 |
6 | EE | Christian Urban,
Andrew M. Pitts,
Murdoch Gabbay:
Nominal unification.
Theor. Comput. Sci. 323(1-3): 473-497 (2004) |
2003 |
5 | EE | Christian Urban,
Andrew M. Pitts,
Murdoch Gabbay:
Nominal Unificaiton.
CSL 2003: 513-527 |
4 | EE | Mark R. Shinwell,
Andrew M. Pitts,
Murdoch Gabbay:
FreshML: programming with binders made simple.
ICFP 2003: 263-274 |
2002 |
3 | EE | Murdoch Gabbay,
Andrew M. Pitts:
A New Approach to Abstract Syntax with Variable Binding.
Formal Asp. Comput. 13(3-5): 341-363 (2002) |
2000 |
2 | | Andrew M. Pitts,
Murdoch Gabbay:
A Metalanguage for Programming with Bound Names Modulo Renaming.
MPC 2000: 230-255 |
1999 |
1 | EE | Murdoch Gabbay,
Andrew M. Pitts:
A New Approach to Abstract Syntax Involving Binders.
LICS 1999: 214-224 |