Andreas Gruchalski

  • Citations Per Year
Learn More
In this paper we investigate a subset of the class of Scott-computable stable functions called Berry-computable. Furthermore we introduce a corresponding notion of an effectively given dI-domain. We obtain the result that the category with these domains as objects and Berrycomputable functions as morphisms has all the important attributes of recursive(More)
  • 1