The proof theory and semantics of intuitionistic modal logic AK Simpson University of Edinburgh. College of Science and Engineering. School of …, 1994 | 624 | 1994 |

Sequent calculi for induction and infinite descent J Brotherston, A Simpson Journal of Logic and Computation 21 (6), 1177-1216, 2011 | 194 | 2011 |

Complete axioms for categorical fixed-point operators A Simpson, G Plotkin Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science …, 2000 | 171 | 2000 |

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 | 132 | 2004 |

Cyclic arithmetic is equivalent to peano arithmetic A Simpson International Conference on Foundations of Software Science and Computation …, 2017 | 81 | 2017 |

Lazy functional algorithms for exact real functionals AK Simpson International Symposium on Mathematical Foundations of Computer Science, 456-464, 1998 | 78 | 1998 |

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 | 69 | 2007 |

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 | 67 | 2010 |

A uniform approach to domain theory in realizability models JR Longley, AK Simpson Mathematical Structures in Computer Science 7 (5), 469-505, 1997 | 64 | 1997 |

A convenient category of domains I Battenfeld, M Schröder, A Simpson Electronic Notes in Theoretical Computer Science 172, 69-99, 2007 | 61 | 2007 |

Behavioural equivalence via modalities for algebraic effects A Simpson, N Voorneveld ACM Transactions on Programming Languages and Systems (TOPLAS) 42 (1), 1-45, 2019 | 49 | 2019 |

Recursive types in Kleisli categories AK Simpson Unpublished manuscript, University of Edinburgh, 1992 | 49 | 1992 |

Elementary axioms for categories of classes AK Simpson Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158 …, 1999 | 48 | 1999 |

The enriched effect calculus: syntax and semantics J Egger, R Ejlers, A Simpson Journal of Logic and Computation 24 (3), 615-654, 2014 | 47 | 2014 |

Reduction in a linear lambda-calculus with applications to operational semantics A Simpson International Conference on Rewriting Techniques and Applications, 219-234, 2005 | 46 | 2005 |

Topological and limit-space subcategories of countably-based equilogical spaces M Menni, A Simpson Mathematical Structures in Computer Science 12 (6), 739-770, 2002 | 45 | 2002 |

Relating first-order set theories, toposes and categories of classes S Awodey, C Butz, A Simpson, T Streicher Annals of Pure and Applied Logic 165 (2), 428-502, 2014 | 42 | 2014 |

Comparing functional paradigms for exact real-number computation A Bauer, MH Escardó, A Simpson International Colloquium on Automata, Languages, and Programming, 488-500, 2002 | 42 | 2002 |

A universal characterization of the closed Euclidean interval MH Escardo, AK Simpson Proceedings 16th Annual IEEE Symposium on Logic in Computer Science, 115-125, 2001 | 41 | 2001 |

Enriching an effect calculus with linear types J Egger, RE Møgelberg, A Simpson Computer Science Logic: 23rd international Workshop, CSL 2009, 18th Annual …, 2009 | 39 | 2009 |