The Next 700 Program Transformers
Geoffrey Hamilton

TL;DR
This paper introduces a hierarchical framework of program transformers, extending positive supercompilation and distillation, with proven termination and analysis of potential speedups at each level.
Contribution
It defines a hierarchy of program transformers, proves their termination, and analyzes the potential speedups achievable at each level.
Findings
Transformers at each hierarchy level terminate.
Hierarchy includes positive supercompilation and distillation.
Potential speedups are characterized for each level.
Abstract
In this paper, we describe a hierarchy of program transformers in which the transformer at each level of the hierarchy builds on top of those at lower levels. The program transformer at level 1 of the hierarchy corresponds to positive supercompilation, and that at level 2 corresponds to distillation. We prove that the transformers at each level terminate. We then consider the speedups that can be obtained at each level in the hierarchy, and try to characterise the improvements that can be made.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Parallel Computing and Optimization Techniques · Quantum Computing Algorithms and Architecture
