Thomas Powell

Orcid: 0000-0002-2541-4678

Affiliations:
  • University of Bath, Bath, Somerset, UK
  • TU Darmstadt, Germany (former)
  • University of Innsbruck, Austria (former)
  • Queen Mary University of London, UK (former)


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

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

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

2023
A finitization of Littlewood's Tauberian theorem and an application in Tauberian remainder theory.
Ann. Pure Appl. Log., April, 2023

2022
A universal algorithm for Krull's theorem.
Inf. Comput., 2022

2020
A note on the finitization of Abelian and Tauberian theorems.
Math. Log. Q., 2020

A unifying framework for continuity and complexity in higher types.
Log. Methods Comput. Sci., 2020

A computational interpretation of Zorn's lemma.
CoRR, 2020

Rates of convergence for iterative solutions of equations involving set-valued accretive operators.
Comput. Math. Appl., 2020

Dependent choice as a termination principle.
Arch. Math. Log., 2020

On the computational content of Zorn's lemma.
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.
J. Log. Comput., 2019

Parametrized bar recursion: a unifying framework for realizability interpretations of classical dependent choice.
J. Log. Comput., 2019

An Algorithmic Approach to the Existence of Ideal Objects in Commutative Algebra.
Proceedings of the Logic, Language, Information, and Computation, 2019

2018
Sequential algorithms and the computational content of classical proofs.
CoRR, 2018

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

A functional interpretation with state.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

2017
Well quasi-orders and the functional interpretation.
CoRR, 2017

Bar recursion over finite partial functions.
Ann. Pure Appl. Log., 2017

2016
Gödel's functional interpretation and the concept of learning.
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.
Math. Struct. Comput. Sci., 2015

On the Computational Content of Termination Proofs.
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.
CoRR, 2014

The equivalence of bar recursion and open recursion.
Ann. Pure Appl. Log., 2014

2013
On bar recursive interpretations of analysis.
PhD thesis, 2013

2012
On Spector's bar recursion.
Math. Log. Q., 2012

Applying Gödel's Dialectica Interpretation to Obtain a Constructive Proof of Higman's Lemma
Proceedings of the Proceedings Fourth Workshop on Classical Logic and Computation, 2012

A Game-Theoretic Computational Interpretation of Proofs in Classical Analysis
CoRR, 2012

2011
System T and the Product of Selection Functions.
Proceedings of the Computer Science Logic, 2011


  Loading...