Searching for "Extended Primitive Recursive Functions." – sorted by Relevance.
-
Extended Grzegorczyk Hierarchy in the BSS Model of Computability
- of primitive recursive functions that we call the Extended Grzegorczyk Hierarchy. Moreover, we show
- Cited by 3 (1 self) – Add To MetaCart
-
A Machine Checked Proof that Ackermann's Function is not Primitive Recursive
- . In section 2 we extend the set of primitive recursive functions to internalize the notion of tuples
- Cited by 6 (0 self) – Add To MetaCart
-
Experience with FS 0 as a framework theory
- calculus, and extended it with primitive recursive functions on, and recursively enumerable classes of, S
- Cited by 15 (4 self) – Add To MetaCart
-
Recursive Analytic Functions of one Complex Variable
- to extend the functional approach of _-recursive and primitive recursive functions. This is where we set in
- Add To MetaCart
-
The Classes of Algorithmically Random Reals
- recursive functions. The partial recursive functions are based on a set of functions known as the primitive
- Add To MetaCart
-
A Functional Approach for Formalizing Regular Hardware Structures
- by PML functions, i.e. PML is Turing--complete. 2.1 Data Types and Primitive Recursion In PML only HOL
- Cited by 4 (3 self) – Add To MetaCart
-
Deaccumulation — Improving Provability
- ) primitive-recursive function calls, i.e., the recursion argument of f has to be a variable that refers to a
- Cited by 3 (1 self) – Add To MetaCart
-
unknown title
- argument t. The right-hand side of an equation for f may only contain (extended) primitive-recursive
- Add To MetaCart
-
Relating Accumulative and Non-Accumulative Functional Programs
- (extended) primitive-recursive function calls, i.e. the first argument of a function call has to be a
- Cited by 10 (5 self) – Add To MetaCart

