Searching for "Recursion from Iteration." – sorted by Relevance.
-
Recursion from Iteration
- Publishers -- Manufactured in The Netherlands Recursion from Iteration ANDRZEJ FILINSKI y (andrzej
- Cited by 8 (0 self) – Add To MetaCart
-
Tarski's Fixed-Point Theorem and Higher-Order Term Rewrite Systems
- , one may derive (full) primitive recursion from iteration. However, this translation is computationally
- Cited by 1 (0 self) – Add To MetaCart
-
Axioms for Recursion in Call-by-Value
- for Filinski's fixpoint operator derived from an iterator (infinite loop constructor) in the presence
- Cited by 8 (5 self) – Add To MetaCart
-
Scheme: An interpreter for extended lambda calculus
- function. How are they different? We intuitively distinguish recursive from iterative programs, for example
- Cited by 52 (2 self) – Add To MetaCart
-
Duality between Call-by-Name Recursion and Call-by-Value Iteration
- for recursors). This construction is based on Filinski's `recursion from iteration' [7]. He showed
- Cited by 9 (4 self) – Add To MetaCart
-
Inductively defined types in the calculus of constructions
- are definable in this calculus. They will be used in Section 5 in order to define primitive recursion from
- Cited by 33 (2 self) – Add To MetaCart

