Formal integration: A program transformation technique

Computer Languages - Tập 6 - Trang 35-46 - 1981
Micha Sharir1
1Tel Aviv University, Department of Mathematical Sciences, Ramat Aviv, Tel Aviv, Israel

Tài liệu tham khảo

Earley, 1976, High-level iterators and a method for automatically designing data structure representation, J. Comput. Lang., 1, 321, 10.1016/0096-0551(75)90019-3 Paige, 1977, Expression continuity and the Formal differentiation of algorithms, 58 Paige, 1979, Expression continuity and the Formal differentiation or algorithms Fong, 1976, Inductive variables in very high level languages, 104 Aho, 1977 Sharir, 1979, Some observations concerning Formal differentiation of set theoretic expressions Paige, 1980, Finite differencing of computable Expressions Dijkstra, 1978, Maximum length of a weakly ascending subsequence of a given sequence Dijkstra, 1980, Some beautiful arguments using mathematical induction, Acta Informat., 13, 1, 10.1007/BF00288531 Burstall, 1977, A transformation system for developing recursive programs, J. Ass. Comput. Mach., 24, 44, 10.1145/321992.321996 Dewar, 1977, MACRO SPITBOL—a SNOBOL4 Compiler, Software Practice and Experience, 7, 95, 10.1002/spe.4380070106 R. B. K. Dewar, M. Sharir and E. Weixelbaum, Transformational derivation of a garbage collection algorithm, To be published. Fong, 1979, Inductively computable constructs in very high level languages, 21