Relational Heuristics for the Design of Deterministic Programs

这个项目的目的是进一步研究编程的本质。对编程本质的深入了解可以用来改进结构化编程技术，并及时促进自动化编程人员的发展。所采用的方法是基于塔斯基的关系代数。在这种方法中，程序构造被看作是在关系代数中求解方程。由于关系的代数不够结构化，这些方程不能系统地求解。这个项目的本质是推导出求解这些方程的启发式网络。为数字计算机编程的任务很复杂。结构化编程的最新进展提供了控制这种复杂性的方法，但仍有许多工作要做。有助于方案拟订过程的简化和系统化的新进展可以产生广泛的多学科影响。

The purpose of this project is to further investigate the nature of programming. Insights gained into the nature of programming can be used to improve the technology of structured programming, and, in time, facilitate the development of automatic programmers. The approach taken is based on Tarski's algebra of relations. In this approach, program construction is viewed in terms of solving equations in the algebra of relations. Since the algebra of relations is not sufficiently structured, these equations cannot be solved systematically. The essence of this project is to derive a network of heuristics for solving these equations. The task of programming digital computers is complex. Recent advances in structured programming have provided ways to control this complexity, but much work remains to be done. New advances that contribute to the simplification and systematization of the programming process can make a broad multi-disciplinary impact.