Oracle Computability and Turing Reducibility in the Calculus of Inductive Constructions
No abstract available.
Related papers
- Inductive Synthesis for Probabilistic Programs Reaches New Horizons TACAS 2021
- Improving Oracle-Guided Inductive Synthesis by Efficient Question Selection OOPSLA 2023
- Oracle-guided scheduling for controlling granularity in implicitly parallel languages JFP 2016
- The weak call-by-value λ-calculus is reasonable for both time and space POPL 2020
- Termination of rewriting in the Calculus of Constructions JFP 2003
- Gradualizing the Calculus of Inductive Constructions TOPLAS 2022
- BlankIt library debloating: getting what you want instead of cutting what you don't PLDI 2020
- Higher order functions and Brouwer's thesis JFP 2021