Parametric Church's Thesis: Synthetic Computability without Choice

In synthetic computability, pioneered by Richman, Bridges, and Bauer, one develops computability theory without an explicit model of computation. This is enabled by assuming an axiom equivalent to postulating a function φ to be universal for the space mathbbN→mathbbN (mathsfCTφ, a consequence of the constructivist axiom mathsfCT), Markov's principle, and at least the axiom of countable choice. Assuming mathsfCT and countable choice invalidates the law of excluded middle, thereby also invalidating classical intuitions prevalent in textbooks on computability. On the other hand, results like Rice's theorem are not provable without a form of choice. In contrast to existing work, we base our investigations in constructive type theory with a separate, impredicative universe of propositions where countable choice does not hold and thus a priori mathsfCTφ and the law of excluded middle seem to be consistent. We introduce various parametric strengthenings of mathsfCTφ, which are equivalent to assuming mathsfCTφ and an Smn operator for φ like in the Smn theorem. The strengthened axioms allow developing synthetic computability theory without choice, as demonstrated by elegant synthetic proofs of Rice's theorem. Moreover, they seem to be not in conflict with classical intuitions since they are consequences of the traditional analytic form of mathsfCT. Besides explaining the novel axioms and proofs of Rice's theorem we contribute machine-checked proofs of all results in the Coq proof assistant.