Recursion Theory (2007)

by Helmut Schwichtenberg

Active Bibliography

7 Recursion on the partial continuous functionals – Helmut Schwichtenberg - 2006
135 Constructivism and Proof Theory – A. S. Troelstra - 2003
TOWARDS A FORMAL THEORY OF COMPUTABILITY – Simon Huber, Basil A. Karádais, Helmut Schwichtenberg
8 Density and Choice for Total Continuous Functionals – Helmut Schwichtenberg - 1996
8 Continuous Functionals of Dependent and Transfinite Types – Ulrich Berger - 1995
3 Modified Bar Recursion – Ulrich Berger, Paulo B. Oliva - 2002
2 Minimisation Vs. Recursion on the Partial Continuous Functionals – Ulrich Berger
Universal Domains For Sequential Computation – Ramarao Kanneganti - 1995
4 On the ubiquity of certain total type structures – John Longley - 2007
6 On sequential functionals of type 3 – Dag Normann - 2006
mlq header will be provided by the publisher Classical truth in higher types – Ulrich Berger
14 Fixed Points and Extensionality in Typed Functional Programming Languages – Brian T. Howard - 1992
Domain-Theoretic Methods for Program Synthesis – Ulrich Berger
13 Logical Full Abstraction and PCF – John Longley, Gordon Plotkin - 1996
16 Higher Order Logic – Daniel Leivant - 1994
1 Applications of inductive definitions and choice principles to program synthesis – Ulrich Berger, Monika Seisenberger
12 Programming Metalogics with a Fixpoint Type – Roy Louis Crole, C Fl Roy Louis Crole, Prof E. Moggi - 1992
8 A proof of strong normalisation using domain theory – Thierry Coquand, Chalmers Tekniska Högskola - 2006
PROOF INTERPRETATIONS AND MAJORIZABILITY – Fernando Ferreira