| A new approach to abstract syntax with variable binding MJ Gabbay, AM Pitts Formal aspects of computing 13, 341-363, 2002 | 717 | 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 | 424 | 1999 |
| Nominal unification C Urban, AM Pitts, MJ Gabbay Theoretical Computer Science 323 (1-3), 473-497, 2004 | 282 | 2004 |
| FreshML: Programming with binders made simple MR Shinwell, AM Pitts, MJ Gabbay Proceedings of the eighth ACM SIGPLAN international conference on Functional …, 2003 | 229 | 2003 |
| Nominal rewriting M Fernández, MJ Gabbay Information and Computation 205 (6), 917-965, 2007 | 192 | 2007 |
| A metalanguage for programming with bound names modulo renaming AM Pitts, MJ Gabbay Mathematics of Program Construction: 5th International Conference, MPC 2000 …, 2000 | 169 | 2000 |
| A theory of inductive definitions with α-equivalence: semantics, implementation, programming language MJ Gabbay University of Cambridge, 2001 | 116 | 2001 |
| Nominal (universal) algebra: equational logic with names and binding MJ Gabbay, A Mathijssen Journal of Logic and Computation 19 (6), 1455-1508, 2009 | 87 | 2009 |
| Nominal unification C Urban, A Pitts, M Gabbay Computer Science Logic: 17th International Workshop CSL 2003, 12th Annual …, 2003 | 74 | 2003 |
| Nominal rewriting systems M Fernández, MJ Gabbay, I Mackie Proceedings of the 6th ACM SIGPLAN international conference on Principles …, 2004 | 70 | 2004 |
| Foundations of nominal techniques: logic and semantics of variables in abstract syntax MJ Gabbay Bulletin of Symbolic Logic 17 (2), 161-229, 2011 | 65 | 2011 |
| One-and-a-halfth-order logic MJ Gabbay, A Mathijssen Proceedings of the 8th ACM SIGPLAN international conference on Principles …, 2006 | 62 | 2006 |
| Freshness and name-restriction in sets of traces with names MJ Gabbay, V Ciancia Foundations of Software Science and Computational Structures: 14th …, 2011 | 60 | 2011 |
| Capture-avoiding substitution as a nominal algebra MJ Gabbay, A Mathijssen Formal Aspects of Computing 20, 451-479, 2008 | 57 | 2008 |
| A sequent calculus for nominal logic M Gabbay, J Cheney Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science …, 2004 | 55 | 2004 |
| The π-calculus in FM MJ Gabbay Thirty Five Years of Automating Mathematics, 247-269, 2003 | 52 | 2003 |
| A general mathematics of names MJ Gabbay Information and Computation 205 (7), 982-1011, 2007 | 48 | 2007 |
| UTxO-vs account-based smart contract blockchain programming paradigms L Brünjes, MJ Gabbay Leveraging Applications of Formal Methods, Verification and Validation …, 2020 | 46 | 2020 |
| A formal calculus for informal equality with binding MJ Gabbay, A Mathijssen International Workshop on Logic, Language, Information, and Computation, 162-176, 2007 | 45 | 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 | 42 | 2010 |
Andrew M PittsEmeritus Professor of Theoretical Computer Science, University of CambridgeEmail verificata su cl.cam.ac.uk
