Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
About primitive recursive algorithms
Selected papers of the 16th international colloquium on Automata, languages, and programming
The Inf function in the system F
Theoretical Computer Science
Intensional aspects of function definitions
Theoretical Computer Science
Computing minimum with primitive recursion over lists
Theoretical Computer Science
Domains and lambda-calculi
Intensionality versus Extensionality and Primitive Recursion
ASIAN '96 Proceedings of the Second Asian Computing Science Conference on Concurrency and Parallelism, Programming, Networking, and Security
Proof-techniques for recursive programs.
Proof-techniques for recursive programs.
Decidability results for primitive recursive algorithms
Theoretical Computer Science
On primitive recursive algorithms and the greatest common divisor function
Theoretical Computer Science
A Representation Theorem for Primitive Recursive Algorithms
Fundamenta Informaticae
| Hi-index | 5.23 |
This paper develops a new semantics (the trace of a computation) that is used to study intensional properties of primitive recursive algorithms. It gives a new proof of the "ultimate obstination theorem" of L. Colson and extends it to the case when mutual recursion is permitted. The ultimate obstination theorem fails when other data types (e.g. lists) are used. I define another property (the backtracking property) of the same nature but which is weaker than the ultimate obstination. This property is proved for every primitive recursive algorithm using any kind of data types. Copyright 2001 Elsevier Science B.V.