Thomas Powell

According to our database, Thomas Powell authored at least 27 papers between 2011 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

Proofs as stateful programs: A first-order logic with abstract Hoare triples, and an interpretation into an imperative language.

Thomas Powell

Log. Methods Comput. Sci., 2024

2023

A finitization of Littlewood's Tauberian theorem and an application in Tauberian remainder theory.

Thomas Powell

Ann. Pure Appl. Log., April, 2023

2022

A universal algorithm for Krull's theorem.

Thomas Powell, Peter Schuster, Franziskus Wiesnet

Inf. Comput., 2022

2020

A note on the finitization of Abelian and Tauberian theorems.

Thomas Powell

Math. Log. Q., 2020

A unifying framework for continuity and complexity in higher types.

Thomas Powell

Log. Methods Comput. Sci., 2020

A computational interpretation of Zorn's lemma.

Thomas Powell

CoRR, 2020

Rates of convergence for iterative solutions of equations involving set-valued accretive operators.

Ulrich Kohlenbach, Thomas Powell

Comput. Math. Appl., 2020

Dependent choice as a termination principle.

Thomas Powell

Arch. Math. Log., 2020

On the computational content of Zorn's lemma.

Thomas Powell

Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

2019

A proof-theoretic study of abstract termination principles.

Thomas Powell

J. Log. Comput., 2019

Parametrized bar recursion: a unifying framework for realizability interpretations of classical dependent choice.

Thomas Powell

J. Log. Comput., 2019

An Algorithmic Approach to the Existence of Ideal Objects in Commutative Algebra.

Thomas Powell, Peter Schuster, Franziskus Wiesnet

Proceedings of the Logic, Language, Information, and Computation, 2019

2018

Sequential algorithms and the computational content of classical proofs.

Thomas Powell

CoRR, 2018

Computational interpretations of classical reasoning: From the epsilon calculus to stateful programs.

Thomas Powell

CoRR, 2018

A functional interpretation with state.

Thomas Powell

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

2017

Well quasi-orders and the functional interpretation.

Thomas Powell

CoRR, 2017

Bar recursion over finite partial functions.

Paulo Oliva, Thomas Powell

Ann. Pure Appl. Log., 2017

2016

Gödel's functional interpretation and the concept of learning.

Thomas Powell

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

2015

A constructive interpretation of Ramsey's theorem via the product of selection functions.

Paulo Oliva, Thomas Powell

Math. Struct. Comput. Sci., 2015

On the Computational Content of Termination Proofs.

Georg Moser, Thomas Powell

Proceedings of the Evolving Computability - 11th Conference on Computability in Europe, 2015

2014

Parametrised bar recursion: A unifying framework for realizability interpretations of classical dependent choice.

Thomas Powell

CoRR, 2014

The equivalence of bar recursion and open recursion.

Thomas Powell

Ann. Pure Appl. Log., 2014

2013

On bar recursive interpretations of analysis.

Thomas Powell

PhD thesis, 2013

2012

On Spector's bar recursion.

Paulo Oliva, Thomas Powell

Math. Log. Q., 2012

Applying Gödel's Dialectica Interpretation to Obtain a Constructive Proof of Higman's Lemma

Thomas Powell

Proceedings of the Proceedings Fourth Workshop on Classical Logic and Computation, 2012

A Game-Theoretic Computational Interpretation of Proofs in Classical Analysis

Paulo Oliva, Thomas Powell

CoRR, 2012

2011

System T and the Product of Selection Functions.

Martín Hötzel Escardó, Paulo Oliva, Thomas Powell

Proceedings of the Computer Science Logic, 2011