The SCEAS System
| |||||||

## Search the dblp DataBase
Murdoch Gabbay:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Michael Gabbay, Murdoch Gabbay
**Some Formal Considerations on Gabbay's Restart Rule in Natural Deduction and Goal-Directed Reasoning.**[Citation Graph (0, 0)][DBLP] We Will Show Them! (1), 2005, pp:701-730 [Conf] - Murdoch Gabbay, Michael Gabbay
**a-logic.**[Citation Graph (0, 0)][DBLP] We Will Show Them! (1), 2005, pp:731-764 [Conf] - Mohammad Reza Mousavi, Murdoch Gabbay, Michel A. Reniers
**SOS for Higher Order Processes.**[Citation Graph (0, 0)][DBLP] CONCUR, 2005, pp:308-322 [Conf] - Christian Urban, Andrew M. Pitts, Murdoch Gabbay
**Nominal Unificaiton.**[Citation Graph (0, 0)][DBLP] CSL, 2003, pp:513-527 [Conf] - Mark R. Shinwell, Andrew M. Pitts, Murdoch Gabbay
**FreshML: programming with binders made simple.**[Citation Graph (0, 0)][DBLP] ICFP, 2003, pp:263-274 [Conf] - Murdoch Gabbay, Aad Mathijssen
**Capture-Avoiding Substitution as a Nominal Algebra.**[Citation Graph (0, 0)][DBLP] ICTAC, 2006, pp:198-212 [Conf] - Murdoch Gabbay, James Cheney
**A Sequent Calculus for Nominal Logic.**[Citation Graph (0, 0)][DBLP] LICS, 2004, pp:139-148 [Conf] - Murdoch Gabbay, Andrew M. Pitts
**A New Approach to Abstract Syntax Involving Binders.**[Citation Graph (0, 0)][DBLP] LICS, 1999, pp:214-224 [Conf] - Andrew M. Pitts, Murdoch Gabbay
**A Metalanguage for Programming with Bound Names Modulo Renaming.**[Citation Graph (0, 0)][DBLP] MPC, 2000, pp:230-255 [Conf] - Murdoch Gabbay
**A new calculus of contexts.**[Citation Graph (0, 0)][DBLP] PPDP, 2005, pp:94-105 [Conf] - Murdoch Gabbay, Aad Mathijssen
**One-and-a-halfth-order logic.**[Citation Graph (0, 0)][DBLP] PPDP, 2006, pp:189-200 [Conf] - Maribel Fernández, Murdoch Gabbay
**Nominal rewriting with name generation: abstraction vs. locality.**[Citation Graph (0, 0)][DBLP] PPDP, 2005, pp:47-58 [Conf] - Maribel Fernández, Murdoch Gabbay, Ian Mackie
**Nominal rewriting systems.**[Citation Graph (0, 0)][DBLP] PPDP, 2004, pp:108-119 [Conf] - Murdoch Gabbay
**Hierarchical Nominal Terms and Their Theory of Rewriting.**[Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2007, v:174, n:5, pp:37-52 [Journal] - Murdoch Gabbay, Andrew M. Pitts
**A New Approach to Abstract Syntax with Variable Binding.**[Citation Graph (0, 0)][DBLP] Formal Asp. Comput., 2002, v:13, n:3-5, pp:341-363 [Journal] - Murdoch Gabbay
**Fresh Logic: proof-theory and semantics for FM and nominal techniques.**[Citation Graph (0, 0)][DBLP] J. Applied Logic, 2007, v:5, n:2, pp:356-387 [Journal] - Christian Urban, Andrew M. Pitts, Murdoch Gabbay
**Nominal unification.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2004, v:323, n:1-3, pp:473-497 [Journal] - Maribel Fernández, Murdoch Gabbay
**Curry-Style Types for Nominal Terms.**[Citation Graph (0, 0)][DBLP] TYPES, 2006, pp:125-139 [Conf] - Murdoch Gabbay, Aad Mathijssen
**A Formal Calculus for Informal Equality with Binding.**[Citation Graph (0, 0)][DBLP] WoLLIC, 2007, pp:162-176 [Conf] - Murdoch Gabbay
**A general mathematics of names.**[Citation Graph (0, 0)][DBLP] Inf. Comput., 2007, v:205, n:7, pp:982-1011 [Journal] - Maribel Fernández, Murdoch Gabbay
**Nominal rewriting.**[Citation Graph (0, 0)][DBLP] Inf. Comput., 2007, v:205, n:6, pp:917-965 [Journal] **Substitution for Fraenkel-Mostowski foundations.**[Citation Graph (, )][DBLP]**One-and-a-Halfth Order Terms: Curry-Howard and Incomplete Derivations.**[Citation Graph (, )][DBLP]**The lambda-context Calculus.**[Citation Graph (, )][DBLP]**a-Logic With Arrows.**[Citation Graph (, )][DBLP]
Search in 0.058secs, Finished in 0.060secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |