Program transformation, symbolic computation and algebraic manipulation. Proceedings of a symposium held at the Research Institute for Mathematical Sciences, Kyoto University, Kyoto, Japan, November 29--December 1, 1999 (Q2743162)

The 16 papers in this collection include: Kiyoshi Akama, Hidekatsu Koike and Eiichi Miyamoto, A theoretical foundation for generation of equivalent transformation rules (44-58); Zenjiro Konishi and Yoshihiko Futamura, A theorem proving system and a terminating process for generalized partial computation (GPC) (Japanese) (59-64); Miyuki Koshimura, Hiroshi Fujita and Ryuzo Hasegawa, MGTP: a model generation theorem prover -- its implementation and application (Japanese) (65-80); Sumitaka Akiba, Taisuke Sato and Fumio Motoyoshi, A proof procedure by completions of logic programs and modified unfolding (Japanese) (81-92); Noriaki Yoshiura and Naoki Yonezaki, A relevant logic ER with extended provability (Japanese) (93-114); Masahiro Matsuya and Yoshihiko Futamura, An application of computer algebra to program transformation (Japanese) (115-122); Mitsuharu Yamamoto, Koichi Takahashi, Masami Hagiya, Shin-ya Nishizaki and Tetsuo Tamai, Formal verification of graph search algorithms and its application to model checking (Japanese) (129-141); Masahiko Tomoishi and Naoki Yonezaki, Composable tableau methods for deciding the consistency of differences in specifications (Japanese) (142-149); Hidekatsu Koike, Kiyoshi Akama and Eiichi Miyamoto, Program synthesis based on searching for efficient equivalent transformation rules (Japanese) (150-161); Takeshi Tsuji, Kiyoshi Akama and Eiichi Miyamoto, Rule generation from specifications that consist of set representations (Japanese) (162-171); Yoshifumi Yuasa, Fusion by occurrence analysis of variables and its iterative application (Japanese) (172-182). The articles of this volume will not be indexed individually.