On transformations of programs
β Scribed by Richard Bird
- Publisher
- Elsevier Science
- Year
- 1974
- Tongue
- English
- Weight
- 503 KB
- Volume
- 8
- Category
- Article
- ISSN
- 0022-0000
No coin nor oath required. For personal study only.
β¦ Synopsis
A treatment is given of a class of program transformations X with the property that for each program P, both P and X(P) compute the same function. Many transformations encountered in the theory of computation can be shown to he in the class and, hence, formally proved to preserve equivalence. As an example, the theory is applied to the proof of a speed up theorem in computational complexity.
π SIMILAR VOLUMES
This paper is concerned with functionality of a logic program. Functionality based on input-output relations declared in predicates is not treated, but functionality of extensionalities of predicates, involved in a logic program, is realized by a dataflow computation and a functional programming (FP
Unfold/fold transformation rules for disjunctive logic programs are proposed in this paper. Our transformation rules preserve the meaning of the programs. @ 1997 Elsevier Science B.V.
Shorter Communications truly circular leading edge but, as before, the stable shape is reached after about 0.4 sec. These observations can be compared with the results of the elegant experiment of WALTERS and DAVIDSON [l] where the initial motion of a two-dimensional bubble was observed without the
North American schools of library and information science (LIS) have traditionally and overwhelmingly focused on providing professional graduate education to practitioners, researchers, and educators in the information sciences and technology. A few schools pioneered undergraduate programs two or mo