A constructive interpretation of Ramsey's Theorem via the product of selection functions P Oliva, T Powell Mathematical structures in computer science 25 (8), 1755-1778, 2015 | 26 | 2015 |

A game-theoretic computational interpretation of proofs in classical analysis P Oliva, T Powell Gentzen's Centenary, 501-531, 2015 | 14 | 2015 |

On Bar Recursive Interpretations of Analysis. TRJ Powell Queen Mary University of London, 2013 | 14 | 2013 |

The equivalence of bar recursion and open recursion T Powell Annals of Pure and Applied Logic 165 (11), 1727-1754, 2014 | 13 | 2014 |

On Spector's bar recursion P Oliva, T Powell Mathematical Logic Quarterly 58 (4‐5), 356-265, 2012 | 13 | 2012 |

System T and the product of selection functions M Escardó, P Oliva, T Powell Computer Science Logic (CSL'11)-25th International Workshop/20th Annual …, 2011 | 13 | 2011 |

Rates of convergence for iterative solutions of equations involving set-valued accretive operators U Kohlenbach, T Powell Computers & Mathematics with Applications 80 (3), 490-503, 2020 | 12 | 2020 |

An algorithmic approach to the existence of ideal objects in commutative algebra T Powell, P Schuster, F Wiesnet International Workshop on Logic, Language, Information, and Computation, 533-549, 2019 | 10 | 2019 |

Gödel's functional interpretation and the concept of learning T Powell Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer …, 2016 | 9 | 2016 |

A universal algorithm for Krull's theorem T Powell, P Schuster, F Wiesnet Information and Computation, 104761, 2021 | 8 | 2021 |

Well quasi-orders and the functional interpretation T Powell Well-Quasi Orders in Computation, Logic, Language and Reasoning, 221-269, 2020 | 8 | 2020 |

A functional interpretation with state T Powell Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer …, 2018 | 8 | 2018 |

Bar recursion over finite partial functions P Oliva, T Powell Annals of Pure and Applied Logic 168 (5), 887-921, 2017 | 8 | 2017 |

Applying G\" odel's Dialectica Interpretation to Obtain a Constructive Proof of Higman's Lemma T Powell arXiv preprint arXiv:1210.3117, 2012 | 7 | 2012 |

Rates of convergence for asymptotically weakly contractive mappings in normed spaces T Powell, F Wiesnet Numerical Functional Analysis and Optimization, 1-37, 2021 | 4 | 2021 |

A unifying framework for continuity and complexity in higher types T Powell Logical Methods in Computer Science 16, 2020 | 4 | 2020 |

A new metastable convergence criterion and an application in the theory of uniformly convex Banach spaces T Powell Journal of Mathematical Analysis and Applications 478 (2), 790-805, 2019 | 4 | 2019 |

On the computational content of Zorn’s lemma T Powell Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer …, 2020 | 3 | 2020 |

Parametrized bar recursion: a unifying framework for realizability interpretations of classical dependent choice T Powell Journal of Logic and Computation 29 (4), 519-554, 2019 | 3 | 2019 |

Computational interpretations of classical reasoning: From the epsilon calculus to stateful programs T Powell Mathesis Universalis, Computability and Proof, 255-290, 2019 | 3 | 2019 |