Search Results for author:
Found 3 papers, 2 papers with code
Oracle Computability and Turing Reducibility in the Calculus of Inductive Constructions
We develop synthetic notions of oracle computability and Turing reducibility in the Calculus of Inductive Constructions (CIC), the constructive type theory underlying the Coq proof assistant.
Church's thesis and related axioms in Coq's type theory
Since neither Weak K\"onig's Lemma nor the fan theorem are a consequence of just logical axioms or just choice-like axioms assumed in constructive logic, it seems likely that $\mathsf{CT}$ is only inconsistent with a combination of classical logic and choice axioms.
Logic in Computer Science
On the Expressive Power of User-Defined Effects: Effect Handlers, Monadic Reflection, Delimited Control
We use the adequate finitary set-theoretic denotational semantics for the monadic calculus to show that effect handlers cannot be macro-expressed while preserving typeability either by monadic reflection or by delimited control.
Logic in Computer Science Programming Languages
