Prof. Olivier Danvy is editor in chief of the Higher Order for Symbolic Computation journal, and is also editor for two books in the LNCS series. This book is written for Dr. Robert (Bob) Paige. Bob Paige, a professor of computer science and a leading researcher in the area of programming languages and transformational programming. Dr. Paige was the author of many research papers, covering related topics in programming languages, compilers, algorithms, and database design. An invited speaker at conferences and university seminars around the world, he also served regularly as a reviewer of research projects for major government agencies. He was a devoted mentor of PhD students who today hold research positions at leading universities and research centers.

From the reviews: "The book starts with an informative preface, with appropriate references signed by all four editors. ... serve as a model for young scientists who are interested in doing quality research in the area. ... Contributions cover a broad area, with an automatic program development focus. It will be a valuable addition to the interested specialist's library." (M. M. Tanik, ACM Computing Reviews, December, 2008)

• Robert Paige's Research: A Retrospective and A Proposal.- Research Retrospective on Transformational Development of Programs.- A National Science Foundation Proposal.- Robert Paige: Brother, Friend, Colleague.- A Song for My Brother.- Robert Paige: Researcher and Teacher.- An Appreciation of Bob Paige.- Bob Paige and the IFIP Working Group 2.1.- Remembrances of Bob Paige.- Contributed Papers.- Transformational Derivation of an Improved Alias Analysis Algorithm.- Dynamic Programming via Static Incrementalization.- Automatic Program Generation from Formal Specifications using APTS.- Universal Regular Path Queries.- Derivation of Efficient Logic Programs by Specialization and Reduction of Nondeterminism.- Computational Divided Differencing and Divided-Difference Arithmetics.- Least Reflexive Points of Relations.- Relativizations for the Logic-Automata Connection.- Efficient Type Matching.- Aspects as Invariants.- Program Transformations: Some Lessons from the 1980s.

Prof. Olivier Danvy is editor in chief of the Higher Order for Symbolic Computation journal, and is also editor for two books in the LNCS series. This book is written for Dr. Robert (Bob) Paige. Bob Paige, a professor of computer science and a leading researcher in the area of programming languages and transformational programming. Dr. Paige was the author of many research papers, covering related topics in programming languages, compilers, algorithms, and database design. An invited speaker at conferences and university seminars around the world, he also served regularly as a reviewer of research projects for major government agencies. He was a devoted mentor of PhD students who today hold research positions at leading universities and research centers.

From the reviews: "The book starts with an informative preface, with appropriate references signed by all four editors. ... serve as a model for young scientists who are interested in doing quality research in the area. ... Contributions cover a broad area, with an automatic program development focus. It will be a valuable addition to the interested specialist's library." (M. M. Tanik, ACM Computing Reviews, December, 2008)

• Robert Paige's Research: A Retrospective and A Proposal.- Research Retrospective on Transformational Development of Programs.- A National Science Foundation Proposal.- Robert Paige: Brother, Friend, Colleague.- A Song for My Brother.- Robert Paige: Researcher and Teacher.- An Appreciation of Bob Paige.- Bob Paige and the IFIP Working Group 2.1.- Remembrances of Bob Paige.- Contributed Papers.- Transformational Derivation of an Improved Alias Analysis Algorithm.- Dynamic Programming via Static Incrementalization.- Automatic Program Generation from Formal Specifications using APTS.- Universal Regular Path Queries.- Derivation of Efficient Logic Programs by Specialization and Reduction of Nondeterminism.- Computational Divided Differencing and Divided-Difference Arithmetics.- Least Reflexive Points of Relations.- Relativizations for the Logic-Automata Connection.- Efficient Type Matching.- Aspects as Invariants.- Program Transformations: Some Lessons from the 1980s.

Prof. Olivier Danvy is editor in chief of the Higher Order for Symbolic Computation journal, and is also editor for two books in the LNCS series. This book is written for Dr. Robert (Bob) Paige. Bob Paige, a professor of computer science and a leading researcher in the area of programming languages and transformational programming. Dr. Paige was the author of many research papers, covering related topics in programming languages, compilers, algorithms, and database design. An invited speaker at conferences and university seminars around the world, he also served regularly as a reviewer of research projects for major government agencies. He was a devoted mentor of PhD students who today hold research positions at leading universities and research centers.

From the reviews: "The book starts with an informative preface, with appropriate references signed by all four editors. ... serve as a model for young scientists who are interested in doing quality research in the area. ... Contributions cover a broad area, with an automatic program development focus. It will be a valuable addition to the interested specialist's library." (M. M. Tanik, ACM Computing Reviews, December, 2008)

• Robert Paige's Research: A Retrospective and A Proposal.- Research Retrospective on Transformational Development of Programs.- A National Science Foundation Proposal.- Robert Paige: Brother, Friend, Colleague.- A Song for My Brother.- Robert Paige: Researcher and Teacher.- An Appreciation of Bob Paige.- Bob Paige and the IFIP Working Group 2.1.- Remembrances of Bob Paige.- Contributed Papers.- Transformational Derivation of an Improved Alias Analysis Algorithm.- Dynamic Programming via Static Incrementalization.- Automatic Program Generation from Formal Specifications using APTS.- Universal Regular Path Queries.- Derivation of Efficient Logic Programs by Specialization and Reduction of Nondeterminism.- Computational Divided Differencing and Divided-Difference Arithmetics.- Least Reflexive Points of Relations.- Relativizations for the Logic-Automata Connection.- Efficient Type Matching.- Aspects as Invariants.- Program Transformations: Some Lessons from the 1980s.