| |
Browse All Reviews > Theory Of Computation (F) > Logics And Meanings Of Programs (F.3) > Studies Of Program Constructs (F.3.3) > Program And Recursion Schemes (F.3.3...)
|
|
 |
|
|
| |
|
|
| |
1-10 of 13
Reviews about "Program And Recursion Schemes (F.3.3...)":
|
Date Reviewed |
| |
Recursion: complexity in cognition
Roeper T., Speas M., Springer Publishing Company, Incorporated, New York, NY, 2014. 267 pp. Type: Book (978-3-319050-85-0)
In 2002, Hauser, Chomsky and Fitch hypothesized that the narrow faculty of language “only includes recursion and is the only uniquely human component of the faculty of language.” This hypothesis led to a rich resear...
|
Jan 7 2015 |
| |
A transformation method for dynamic-sized tabulation
Chin W., Hagiya M. (ed) Acta Informatica 32(2): 93-115, 1995. Type: Article
Direct computation of recursive functions often leads to a repeated evaluation of the same recursive calls. Various techniques to overcome this drawback exist. The authors develop their methods on the basis of tupling and memoization, ...
|
Jul 1 1996 |
| |
A new approach to recursion removal
Harrison P., Khoshnevisan H. Theoretical Computer Science 93(1): 91-113, 1992. Type: Article
Given a recursive equation defining a recursive function (in other words, given a functional program), write an imperative-style loop program computing the same function. This paper shows how to mechanically perform this transformation...
|
Aug 1 1993 |
| |
An algorithm deciding functional equivalence in a new class of program schemes
Sabelfeld V. Theoretical Computer Science 71(2): 265-279, 1990. Type: Article
The equivalence of program schemes is undecidable, even for restricted classes of schemes. Early decidability results for classes of schemes were obtained by Ianov [1] and Bird [2]. The author proposes an algorithm deciding functional ...
|
Apr 1 1992 |
| |
Interprocedural slicing using dependence graphs
Horwitz S., Reps T., Binkley D. ACM Transactions on Programming Languages and Systems 12(1): 26-60, 1990. Type: Article
The behavior of a program is usually defined by the behavior of the process performed by a computer executing a translation of the program. One tool used to study program behavior is the representation of the program by an adequate int...
|
May 1 1991 |
| |
On the productivity of recursive list definitions
Sijtsma B. ACM Transactions on Programming Languages and Systems 11(4): 633-649, 1989. Type: Article
The paper deals with computation on infinite lists, more precisely on infinite lists in which each element can be evaluated in finite time: the most direct example is given by the list of the integers f ( n ), where ...
|
Aug 1 1990 |
| |
Decidable properties of monadic recursive schemas with a depth parameter
Gonczarowski J. Acta Informatica 22(3): 277-310, 1985. Type: Article
Monadic Table Counter Schemas (MTCSs) are defined as an extension of monadic recursive schemas studied by Ashcroft, Manna, and Pnueli [1]. The extension consists in adding a second parameter with restricted facilities to every function...
|
Oct 1 1987 |
| |
Complexity of the combinator reduction machine
Hirokawa S. Theoretical Computer Science 41(2-3): 289-303, 1985. Type: Article
Combinator Reduction Machine (CRM) is a model for computing recursive programs. Bodies of functions defined by a program are represented by binary graphs, as are the so-called combinator codes. Combinators occurring in them indicate to...
|
May 1 1987 |
| |
Necessary and sufficient conditions for the universality of programming formalisms
Kfoury A., Urzyczyn P. Acta Informatica 22(4): 347-377, 1985. Type: Article
Over many familiar datatypes, the notion of “computable” coincides with the notion of “flowchartable.” For example, every partial recursive function is definable by a flowchart program over the d...
|
Mar 1 1987 |
| |
Pseudo-recursive procedures
Armbruster D., Oechsle R. Computing 35(3-4): 247-256, 1985. Type: Article
Most language implementors seem to be aware of the fact that if a procedure P is local to (nested within) a procedure Q, and P can call itself recursive only indirectly, always through another call of Q, the...
|
Aug 1 1986 |
| |
|
|
| |
|
|
