| Modelling environments in call-by-value programming languages PB Levy, J Power, H Thielecke Information and computation 185 (2), 182-210, 2003 | 232 | 2003 |
| Categorical structure of continuation passing style H Thielecke University of Edinburgh. College of Science and Engineering. School of …, 1997 | 146 | 1997 |
| Closed Freyd-and κ-categories J Power, H Thielecke Automata, Languages and Programming, 709-710, 1999 | 95 | 1999 |
| Linear continuation-passing J Berdine, P O'hearn, U Reddy, H Thielecke Higher-Order and Symbolic Computation 15 (2), 181-208, 2002 | 74 | 2002 |
| Static analysis for regular expression denial-of-service attacks J Kirrage, A Rathnayake, H Thielecke International conference on network and system security, 135-148, 2013 | 72 | 2013 |
| From control effects to typed continuation passing H Thielecke ACM SIGPLAN Notices 38 (1), 139-149, 2003 | 62 | 2003 |
| Comparing control constructs by double-barrelled CPS H Thielecke Higher-Order and Symbolic Computation 15 (2), 141-160, 2002 | 45 | 2002 |
| Comparing control constructs by typing double-barrelled CPS transforms H Thielecke Amr Sabry editor December 2000, 17, 2000 | 45* | 2000 |
| Static analysis for regular expression exponential runtime via substructural logics A Rathnayake, H Thielecke CoRR abs/1405.7058, 2014 | 41 | 2014 |
| A type-theoretic reconstruction of the visitor pattern P Buchlovsky, H Thielecke Electronic notes in theoretical computer science 155, 309-329, 2006 | 39 | 2006 |
| Environments, continuation semantics and indexed categories J Power, H Thielecke Theoretical Aspects of Computer Software, 391-414, 1997 | 37 | 1997 |
| Typed exceptions and continuations cannot macro-express each other J Riecke, H Thielecke Automata, Languages and Programming, 700-700, 1999 | 33 | 1999 |
| An Introduction to Landin's “A Generalization of Jumps and Labels” H Thielecke Higher-Order and Symbolic Computation 11 (2), 117-123, 1998 | 33 | 1998 |
| Continuation semantics and self-adjointness H Thielecke Electronic Notes in Theoretical Computer Science 6, 348-364, 1997 | 33 | 1997 |
| On the call-by-value CPS transform and its semantics C Fuhrmann, H Thielecke Information and Computation 188 (2), 241-283, 2004 | 31 | 2004 |
| Linearly used continuations J Berdine, PW O’hearn, US Reddy, H Thielecke Proceedings of the Third ACM SIGPLAN Workshop on Continuations (CW’01), 47-54, 2000 | 25 | 2000 |
| On exceptions versus continuations in the presence of state H Thielecke Programming Languages and Systems, 397-411, 2000 | 24 | 2000 |
| Answer type polymorphism in call-by-name continuation passing H Thielecke Programming Languages and Systems, 279-293, 2004 | 21 | 2004 |
| Continuations, functions and jumps H Thielecke ACM SIGACT News 30 (2), 33-42, 1999 | 21 | 1999 |
| Using a continuation twice and its implications for the expressive power of call/cc H Thielecke Higher-Order and Symbolic Computation 12 (1), 47-73, 1999 | 19 | 1999 |
John PowerHonorary Professor in Computing, Macquarie UniversityVerified email at bath.edu
