![]() | ![]() |
Murdoch Gabbay
List of publications from the DBLP Bibliography Server - FAQ
| 2012 | ||
|---|---|---|
| 53 | Murdoch Gabbay, Aleksandar Nanevski: Denotation of syntax and metaprogramming in contextual modal type theory (CMTT) CoRR abs/1202.0904: (2012) | |
| 52 | 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) | |
| 51 | Murdoch James Gabbay: Unity in nominal equational reasoning: The algebra of equality on nominal sets. J. Applied Logic 10(2): 199-217 (2012) | |
| 2011 | ||
| 50 | Murdoch James Gabbay, Tadeusz Litak, Daniela Petrisan: Stone Duality for Nominal Boolean Algebras with И. CALCO 2011: 192-207 | |
| 49 | Elliot Fairweather, Maribel Fernández, Murdoch James Gabbay: Principal Types for Nominal Theories. FCT 2011: 160-172 | |
| 48 | Murdoch James Gabbay, Vincenzo Ciancia: Freshness and Name-Restriction in Sets of Traces with Names. FOSSACS 2011: 365-380 | |
| 47 | Murdoch James Gabbay, Dominic P. Mulligan: Nominal Henkin Semantics: simply-typed lambda-calculus models in nominal sets LFMTP 2011: 58-75 | |
| 46 | Murdoch James Gabbay: Foundations of nominal techniques: logic and semantics of variables in abstract syntax. Bulletin of Symbolic Logic 17(2): 161-229 (2011) | |
| 45 | Gilles Dowek, Murdoch Gabbay: From nominal sets binding to CoRR abs/1111.4611: (2011) | |
| 44 | Murdoch James Gabbay: Finite and infinite support in nominal algebra and logic: nominal completeness theorems for free CoRR abs/1112.0923: (2011) | |
| 43 | Murdoch James Gabbay: Two-level nominal sets and semantic nominal terms: an extension of nominal set theory for handling meta-variables. Mathematical Structures in Computer Science 21(5): 997-1033 (2011) | |
| 2010 | ||
| 42 | Maribel Fernández, Murdoch James Gabbay: Closed nominal rewriting and efficiently computable nominal algebra equality LFMTP 2010: 37-51 | |
| 41 | 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 | |
| 40 | Gilles Dowek, Murdoch James Gabbay: Permissive-nominal logic. PPDP 2010: 165-176 | |
| 39 | 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) | |
| 38 | Murdoch James Gabbay, Aad Mathijssen: A Nominal Axiomatization of the Lambda Calculus. J. Log. Comput. 20(2): 501-531 (2010) | |
| 37 | Gilles Dowek, Murdoch James Gabbay, Dominic P. Mulligan: Permissive nominal terms and their unification: an infinite, co-infinite approach to nominal techniques. Logic Journal of the IGPL 18(6): 769-822 (2010) | |
| 2009 | ||
| 36 | 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 | |
| 35 | Murdoch James Gabbay, Dominic P. Mulligan: Two-level Lambda-calculus. Electr. Notes Theor. Comput. Sci. 246: 107-129 (2009) | |
| 34 | Michael Gabbay, Murdoch James Gabbay: Term Sequent Logic. Electr. Notes Theor. Comput. Sci. 246: 87-106 (2009) | |
| 33 | Murdoch James Gabbay, Stéphane Lengrand: The lambda-context calculus (extended version). Inf. Comput. 207(12): 1369-1400 (2009) | |
| 32 | Murdoch James Gabbay: Nominal Algebra and the HSP Theorem. J. Log. Comput. 19(2): 341-367 (2009) | |
| 31 | Murdoch James Gabbay, Aad Mathijssen: Nominal (Universal) Algebra: Equational Logic with Names and Binding. J. Log. Comput. 19(6): 1455-1508 (2009) | |
| 30 | Murdoch James Gabbay: A study of substitution, using nominal techniques and Fraenkel-Mostowksi sets. Theor. Comput. Sci. 410(12-13): 1159-1189 (2009) | |
| 2008 | ||
| 29 | Murdoch Gabbay, Michael Gabbay: Substitution for Fraenkel-Mostowski foundations. AISB Convention 2008: 65-72 | |
| 28 | Murdoch James Gabbay, Martin Hofmann: Nominal Renaming Sets. LPAR 2008: 158-173 | |
| 27 | Murdoch Gabbay, Dominic P. Mulligan: One-and-a-Halfth Order Terms: Curry-Howard and Incomplete Derivations. WoLLIC 2008: 179-193 | |
| 26 | Murdoch Gabbay, Stéphane Lengrand: The lambda-context Calculus. Electr. Notes Theor. Comput. Sci. 196: 19-35 (2008) | |
| 25 | Murdoch Gabbay, Michael Gabbay: a-Logic With Arrows. Electr. Notes Theor. Comput. Sci. 216: 3-29 (2008) | |
| 24 | Murdoch James Gabbay, Aad Mathijssen: Capture-avoiding substitution as a nominal algebra. Formal Asp. Comput. 20(4-5): 451-479 (2008) | |
| 23 | Murdoch James Gabbay, Aad Mathijssen: One-and-a-halfth-order Logic. J. Log. Comput. 18(4): 521-562 (2008) | |
| 2007 | ||
| 22 | Murdoch Gabbay, Aad Mathijssen: A Formal Calculus for Informal Equality with Binding. WoLLIC 2007: 162-176 | |
| 21 | Murdoch Gabbay: Hierarchical Nominal Terms and Their Theory of Rewriting. Electr. Notes Theor. Comput. Sci. 174(5): 37-52 (2007) | |
| 20 | Maribel Fernández, Murdoch Gabbay: Nominal rewriting. Inf. Comput. 205(6): 917-965 (2007) | |
| 19 | Murdoch Gabbay: A general mathematics of names. Inf. Comput. 205(7): 982-1011 (2007) | |
| 18 | Murdoch Gabbay: Fresh Logic: proof-theory and semantics for FM and nominal techniques. J. Applied Logic 5(2): 356-387 (2007) | |
| 2006 | ||
| 17 | Murdoch Gabbay, Aad Mathijssen: Capture-Avoiding Substitution as a Nominal Algebra. ICTAC 2006: 198-212 | |
| 16 | Murdoch Gabbay, Aad Mathijssen: One-and-a-halfth-order logic. PPDP 2006: 189-200 | |
| 15 | Maribel Fernández, Murdoch Gabbay: Curry-Style Types for Nominal Terms. TYPES 2006: 125-139 | |
| 2005 | ||
| 14 | Mohammad Reza Mousavi, Murdoch Gabbay, Michel A. Reniers: SOS for Higher Order Processes. CONCUR 2005: 308-322 | |
| 13 | Maribel Fernández, Murdoch Gabbay: Nominal rewriting with name generation: abstraction vs. locality. PPDP 2005: 47-58 | |
| 12 | Murdoch Gabbay: A new calculus of contexts. PPDP 2005: 94-105 | |
| 11 | 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 | |
| 10 | Murdoch Gabbay, Michael Gabbay: a-logic. We Will Show Them! (1) 2005: 731-764 | |
| 2004 | ||
| 9 | Murdoch Gabbay, James Cheney: A Sequent Calculus for Nominal Logic. LICS 2004: 139-148 | |
| 8 | Maribel Fernández, Murdoch Gabbay, Ian Mackie: Nominal rewriting systems. PPDP 2004: 108-119 | |
| 7 | Christian Urban, Andrew M. Pitts, Murdoch Gabbay: Nominal unification. Theor. Comput. Sci. 323(1-3): 473-497 (2004) | |
| 2003 | ||
| 6 | Christian Urban, Andrew M. Pitts, Murdoch Gabbay: Nominal Unificaiton. CSL 2003: 513-527 | |
| 5 | Mark R. Shinwell, Andrew M. Pitts, Murdoch Gabbay: FreshML: programming with binders made simple. ICFP 2003: 263-274 | |
| 4 | Mark R. Shinwell, Andrew M. Pitts, Murdoch James Gabbay: FreshML: programming with binders made simple. SIGPLAN Notices 38(9): 263-274 (2003) | |
| 2002 | ||
| 3 | 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 | Murdoch Gabbay, Andrew M. Pitts: A New Approach to Abstract Syntax Involving Binders. LICS 1999: 214-224 | |
| 1 | James Cheney | [9] |
| 2 | Vincenzo Ciancia | [48] |
| 3 | Gilles Dowek | [37] [40] [45] |
| 4 | Elliot Fairweather | [49] |
| 5 | Maribel Fernández | [8] [13] [15] [20] [42] [49] |
| 6 | Michael Gabbay | [10] [11] [25] [29] [34] [41] |
| 7 | Martin Hofmann | [28] |
| 8 | Stéphane Lengrand | [26] [33] |
| 9 | Tadeusz Litak | [50] |
| 10 | Ian Mackie | [8] |
| 11 | Aad Mathijssen | [16] [17] [22] [23] [24] [31] [38] |
| 12 | Mohammad Reza Mousavi | [14] |
| 13 | Dominic P. Mulligan | [27] [35] [36] [37] [39] [47] [52] |
| 14 | Aleksandar Nanevski | [53] |
| 15 | Daniela Petrisan | [50] |
| 16 | Andrew M. Pitts | [1] [2] [3] [4] [5] [6] [7] |
| 17 | Michel A. Reniers | [14] |
| 18 | Mark R. Shinwell | [4] [5] |
| 19 | Christian Urban | [6] [7] |
Colors in the list of coauthors
Last update Wed May 30 22:34:44 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page