Thomas Powell - RankMe

38 papers A* 3B 2C 3Journal 28Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	B	`conf`	On the Algorithmic Structure of Dialectica Realisers. CSL Davide Barbarossa, Thomas Powell
2025	C	`conf`	Generalized Learnability of Stochastic Principles. CiE Morenikeji Neri, Nicholas Pischke, Thomas Powell
2025	J	`jnl`	On the algorithmic structure of Dialectica programs. CoRR Davide Barbarossa, Thomas Powell
2025	J	`jnl`	On the asymptotic behaviour of stochastic processes, with applications to supermartingale convergence, Dvoretzky's approximation theorem, and stochastic quasi-Fejér monotonicity. CoRR Morenikeji Neri, Nicholas Pischke, Thomas Powell
2024	J	`jnl`	Asymptotic regularity of a generalised stochastic Halpern scheme with applications. CoRR Nicholas Pischke, Thomas Powell
2024	J	`jnl`	Proofs as stateful programs: A first-order logic with abstract Hoare triples, and an interpretation into an imperative language. Log. Methods Comput. Sci. Thomas Powell
2023	J	`jnl`	A finitization of Littlewood's Tauberian theorem and an application in Tauberian remainder theory. Ann. Pure Appl. Log. Thomas Powell
2022	J	`jnl`	A universal algorithm for Krull's theorem. Inf. Comput. Thomas Powell, Peter Schuster, Franziskus Wiesnet
2020	J	`jnl`	A computational interpretation of Zorn's lemma. CoRR Thomas Powell
2020	J	`jnl`	A note on the finitization of Abelian and Tauberian theorems. Math. Log. Q. Thomas Powell
2020	J	`jnl`	A unifying framework for continuity and complexity in higher types. Log. Methods Comput. Sci. Thomas Powell
2020	J	`jnl`	Dependent choice as a termination principle. Arch. Math. Log. Thomas Powell
2020	A*	`conf`	On the computational content of Zorn's lemma. LICS Thomas Powell
2020	J	`jnl`	Rates of convergence for iterative solutions of equations involving set-valued accretive operators. Comput. Math. Appl. Ulrich Kohlenbach, Thomas Powell
2019	J	`jnl`	A proof-theoretic study of abstract termination principles. J. Log. Comput. Thomas Powell
2019	J	`jnl`	A unifying framework for continuity and complexity in higher types. CoRR Thomas Powell
2019	C	`conf`	An Algorithmic Approach to the Existence of Ideal Objects in Commutative Algebra. WoLLIC Thomas Powell, Peter Schuster, Franziskus Wiesnet
2019	J	`jnl`	An algorithmic approach to the existence of ideal objects in commutative algebra. CoRR Thomas Powell, Peter M. Schuster, Franziskus Wiesnet
2019	J	`jnl`	Dependent choice as a termination principle. CoRR Thomas Powell
2019	J	`jnl`	Parametrized bar recursion: a unifying framework for realizability interpretations of classical dependent choice. J. Log. Comput. Thomas Powell
2018	A*	`conf`	A functional interpretation with state. LICS Thomas Powell
2018	J	`jnl`	Computational interpretations of classical reasoning: From the epsilon calculus to stateful programs. CoRR Thomas Powell
2018	J	`jnl`	Sequential algorithms and the computational content of classical proofs. CoRR Thomas Powell
2017	J	`jnl`	A proof theoretic study of abstract termination principles. CoRR Thomas Powell
2017	J	`jnl`	Bar recursion over finite partial functions. Ann. Pure Appl. Log. Paulo Oliva, Thomas Powell
2017	J	`jnl`	Well quasi-orders and the functional interpretation. CoRR Thomas Powell
2016	A*	`conf`	Gödel's functional interpretation and the concept of learning. LICS Thomas Powell
2015	J	`jnl`	A constructive interpretation of Ramsey's theorem via the product of selection functions. Math. Struct. Comput. Sci. Paulo Oliva, Thomas Powell
2015	C	`conf`	On the Computational Content of Termination Proofs. CiE Georg Moser, Thomas Powell
2014	J	`jnl`	Bar recursion over finite partial functions. CoRR Paulo Oliva, Thomas Powell
2014	J	`jnl`	Parametrised bar recursion: A unifying framework for realizability interpretations of classical dependent choice. CoRR Thomas Powell
2014	J	`jnl`	The equivalence of bar recursion and open recursion. Ann. Pure Appl. Log. Thomas Powell
2013	—	`—`	On bar recursive interpretations of analysis. Thomas Powell
2012	J	`jnl`	A Constructive Interpretation of Ramsey's Theorem via the Product of Selection Functions CoRR Paulo Oliva, Thomas Powell
2012	J	`jnl`	A Game-Theoretic Computational Interpretation of Proofs in Classical Analysis CoRR Paulo Oliva, Thomas Powell
2012	—	`conf`	Applying Gödel's Dialectica Interpretation to Obtain a Constructive Proof of Higman's Lemma CL&C Thomas Powell
2012	J	`jnl`	On Spector's bar recursion. Math. Log. Q. Paulo Oliva, Thomas Powell
2011	B	`conf`	System T and the Product of Selection Functions. CSL Martín Hötzel Escardó, Paulo Oliva, Thomas Powell