| The proof theory and semantics of intuitionistic modal logic AK Simpson University of Edinburgh. College of Science and Engineering. School of …, 1994 | 538 | 1994 |
| Complete axioms for categorical fixed-point operators A Simpson, G Plotkin Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science …, 2000 | 165 | 2000 |
| Sequent calculi for induction and infinite descent J Brotherston, A Simpson Journal of Logic and Computation 21 (6), 1177-1216, 2011 | 156 | 2011 |
| Comparing Cartesian closed categories of (core) compactly generated spaces M Escardó, J Lawson, A Simpson Topology and its Applications 143 (1-3), 105-145, 2004 | 124 | 2004 |
| Lazy functional algorithms for exact real functionals AK Simpson International Symposium on Mathematical Foundations of Computer Science, 456-464, 1998 | 74 | 1998 |
| A convenient category of domains I Battenfeld, M Schröder, A Simpson Electronic Notes in Theoretical Computer Science 172, 69-99, 2007 | 63 | 2007 |
| A uniform approach to domain theory in realizability models JR Longley, AK Simpson Mathematical Structures in Computer Science 7 (5), 469-505, 1997 | 59 | 1997 |
| A generic operational metatheory for algebraic effects P Johann, A Simpson, J Voigtländer 2010 25th Annual IEEE Symposium on Logic in Computer Science, 209-218, 2010 | 57 | 2010 |
| Complete sequent calculi for induction and infinite descent J Brotherston, A Simpson 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), 51-62, 2007 | 56 | 2007 |
| Cyclic arithmetic is equivalent to peano arithmetic A Simpson International Conference on Foundations of Software Science and Computation …, 2017 | 52 | 2017 |
| Elementary axioms for categories of classes AK Simpson Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158 …, 1999 | 50 | 1999 |
| Recursive types in Kleisli categories AK Simpson Unpublished manuscript, University of Edinburgh, 1992 | 44 | 1992 |
| Topological and limit-space subcategories of countably-based equilogical spaces M Menni, A Simpson Mathematical Structures in Computer Science 12 (6), 739-770, 2002 | 43 | 2002 |
| Reduction in a linear lambda-calculus with applications to operational semantics A Simpson International Conference on Rewriting Techniques and Applications, 219-234, 2005 | 42 | 2005 |
| The enriched effect calculus: syntax and semantics J Egger, R Ejlers, A Simpson Journal of Logic and Computation 24 (3), 615-654, 2014 | 40 | 2014 |
| Behavioural equivalence via modalities for algebraic effects A Simpson, N Voorneveld ACM Transactions on Programming Languages and Systems (TOPLAS) 42 (1), 1-45, 2019 | 37 | 2019 |
| Comparing functional paradigms for exact real-number computation A Bauer, MH Escardó, A Simpson International Colloquium on Automata, Languages, and Programming, 488-500, 2002 | 37 | 2002 |
| A universal characterization of the closed Euclidean interval MH Escardó, AK Simpson Proceedings 16th Annual IEEE Symposium on Logic in Computer Science, 115-125, 2001 | 37 | 2001 |
| Categorical completeness results for the simply-typed lambda-calculus AK Simpson International Conference on Typed Lambda Calculi and Applications, 414-427, 1995 | 37 | 1995 |
| Enriching an effect calculus with linear types J Egger, RE Mřgelberg, A Simpson International Workshop on Computer Science Logic, 240-254, 2009 | 36 | 2009 |
