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 ...
Somewhere for me to play with writing my own language. Somewhere for me and others to play with primitive recursive functions. Normally, when reading examples of PRFs, the types are implicit. We'll ...
Abstract: Linearity and ramification constraints have been widely used to weaken higher-order (primitive) recursion in such a way that the class of representable functions equals the class of poly ...
In this lecture we finish the discuss the introduction and elimination rules for natural numbers. The latter is a constructive formulation of the principle of mathematical induction. When we eliminate ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results