Counting Is Hard

Thesis

Weihrauch Reducibility from a Categorical Lens

I. Price. Submitted to Swansea University

Publications

• Implicit automata in λ-calculi III: first-order transductions and affine planar λ-terms (local copy) (bibtex)

  C. Pradic & I. Price. Accepted to MFPS 2024

• Weihrauch Problems as Containers (preprint)

  C. Pradic & I. Price

• Weihrauch Problems as Containers (bibtex)

  C. Pradic & I. Price. Accepted to Computability in Europe 2025

  Published in Crossroads of Computability and Logic: Insights, Inspirations, and Innovations.

• Weihrauch Problems as Containers (abstract)

  C. Pradic & I. Price. Contributed talk to TYPES 2025

• Problems with fixpoints of polynomials of polynomials (preprint)

  C. Pradic & I. Price

• Problems with fixpoints of polynomials of polynomials (bibtex)

  C. Pradic & I. Price. Accepted to Logic In Computer Science 2026

  Published in LIPIcs, Volume 380.