Primitive Recursive Function: A class of total functions built from basic initial functions using composition and primitive recursion, often serving as a theoretical foundation in computability.

We observe that the computational inefficiency of branched recursive functions was not appropriately covered in almost all textbooks for computer science courses in the first three years of the ...

Course content The course gives an introduction to basic computability theory. This theory can be regarded as a systematic mathematical theory of algorithms and computations. Learning outcome After ...

For a restricted program calculus based on these morphisms, we constructively prove two formal results, whose pragmatic message is: (1) A programming language based on catamorphisms is computationally ...