primitive recursive functions

Sorting algorithms as recursive functions

This paper is an experiment in presenting programming algorithms as recursive functions, without pseudo-code or genuine code. The algorithms presented are the standard basic sorting algorithms with some computational complexity analysis. The style is that of ordinary working mathematics although

Primitive recursion over words

From: @book{Peter:1982:RFC:539249, author = {Peter, Roezsa}, title = {Recursive Functions in Computer Theory}, year = {1982}, isbn = {0470271957}, publisher = {Halsted Press}, address = {New York, NY, USA}, }