Searching for "Linear Recursive Functions." – sorted by Relevance.
-
Parallel Implementations of Combinations of Broadcast, Reduction and Scan
- performance. These skeletons are also linearly recursive. Keywords: functional programming, linear recursion
- Cited by 2 (2 self) – Add To MetaCart
-
Constraint-Based Query Evaluation in Deductive Databases
- -based query evaluation, compilation techniques, linear recursions, functional recursions, recursive query
- Cited by 3 (3 self) – Add To MetaCart
-
Program Transformation Expressed in the DEVA Meta-Calculus
- Movement for the optimization of linearly recursive functions. The proof of the correctness of the schema and the necessary
- Add To MetaCart
-
Proving Transformations in Isabelle
- , an example verification of the classical "Linear Recursive Function to Tail Recursive Function" [BW 84
- Cited by 1 (0 self) – Add To MetaCart
-
Indexing and Querying Constantly Evolving Data Using Time Series Analysis
- linear or recursive function to define the data evolution, however, in many applications, the data
- Cited by 1 (1 self) – Add To MetaCart
-
PType system: A featherweight parallelizability detector
- with accumulating parameters, as well as a class of non-linear mutual-recursive functions. Programs whose types
- Cited by 3 (3 self) – Add To MetaCart
-
Recursive Algorithms in Computer Science Courses: Fibonacci Numbers and Binomial Coefficients
- functions into linear and branched ones. Linear recursive functions make only one recursive call to itself
- Add To MetaCart
-
Transformational construction of correct pointer algorithms
- have a linear recursive function working on pointer structures. But what we want is an imperative
- Cited by 1 (1 self) – Add To MetaCart
-
From Algebraic Sets to Monomial Linear Bases By Means of Combinatorial Algorithms.
- s ) of the characteristic ideal J of the n-linearly recursive functions we are considering. In this case we may calculate a
- Cited by 5 (0 self) – Add To MetaCart
-
Type Systems For Polynomial-Time Computation
- and substitution of parameters. Indeed, "linear" recursion with functional result type A = N k !N can always
- Cited by 7 (1 self) – Add To MetaCart

