Oracle Computability and Turing Reducibility in the Calculus of Inductive 
Constructions

Forster, Yannick; Kirst, Dominik; Mück, Niklas

doi:10.1007/978-981-99-8311-7_8

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Oracle Computability and Turing Reducibility in the Calculus of Inductive Constructions

MPS-Authors

/persons/resource/persons296856

Mück, Niklas
Group D. Dreyer, Max Planck Institute for Software Systems, Max Planck Society;

External Resource

https://rdcu.be/dAD1D
(Publisher version)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Forster, Y., Kirst, D., & Mück, N. (2023). Oracle Computability and Turing Reducibility in the Calculus of Inductive Constructions. In C.-K. Hur (Ed.), Programming Languages and Systems (pp. 155-181). Berlin: Springer.

Cite as: https://hdl.handle.net/21.11116/0000-000E-A5D8-4

Abstract

There is no abstract available