Formalization of Properties of Functional Programs
- 1 July 1970
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 17 (3), 555-569
- https://doi.org/10.1145/321592.321606
Abstract
The problems of convergence, correctness, and equivalence of computer programs can be formulated by means of the satisfiability or validity of certain first-order formulas. An algorithm is presented for constructing such formulas for functional programs, i.e. programs defined by LISP-like conditional recursive expressions.Keywords
This publication has 3 references indexed in Scilit:
- The correctness of programsJournal of Computer and System Sciences, 1969
- Properties of Programs and the First-Order Predicate CalculusJournal of the ACM, 1969
- Assigning meanings to programsPublished by American Mathematical Society (AMS) ,1967