Abstract: A revision of the basic concepts of type, function (called here operation), and relation is proposed. A simple generic method is presented for constructing operations and types as concrete ...

Add a description, image, and links to the primitive-recursion topic page so that developers can more easily learn about it.

Abstract: In a previous paper we introduced a system of recursion operators for formulating pure logic programs, dispensing with explicit recursions. The recursion operators, some of which are similar ...

Woodward J (2005) Invariants of Function Complexity under Primitive Recursive Functions. In: Mirkin B & Magoulas G (eds.) UKCI 2005: Proceedings of the 2005 UK Workshop on Computational Intelligence.

Reversible programming languages and computing represent a forward‐looking paradigm in which every computational operation is designed to be invertible. In these systems, each transition from one ...

Can higher-order functional programs solve more problems than first-order programs? Answer: NO, since both program classes are Turing complete. The reason is that higher-order values can be simulated ...

For the more mathematically include, the definition of Primitive Recursive Functions is provided here. For the mere mortals, such as me, I will attempt to give a more intuitional definition. Primitive ...

Woodward J (2006) Invariance of function complexity under primitive recursive functions. In: Collet P, Tomassini M, Ebner M, Gustafson S & Ekart A (eds.) Genetic Programming: 9th European Conference, ...