Computing with partial continuous functionals

Prof. Dr. Helmut Schwichtenberg Ludwig-Maximilians-Universitaet Muenchen, Germany Homepage

We define computable functionals of finite type, with the Scott-Ersov partial continuous functionals as domains. A term language T+ (a common extension of Goedel's T and Plotkin's PCF) is introduced to denote computable functionals.