3 citations · 3 across the 3 of their papers we have counts for
3 papers
cs.LO2023
Oracle Computability and Turing Reducibility in the Calculus of Inductive Constructions
Yannick Forster, Dominik Kirst, Niklas Mück
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…
cs.LO2021★ 3 cited
Parametric Church's Thesis: Synthetic Computability without Choice
Yannick Forster
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 axi…
cs.LO2016
On the Expressive Power of User-Defined Effects: Effect Handlers, Monadic Reflection, Delimited Control
Yannick Forster, Ohad Kammar, Sam Lindley +1
We compare the expressive power of three programming abstractions for user-defined computational effects: Bauer and Pretnar's effect handlers, Filinski's monadic reflection, and de…