Proving Theorems about LISP Functions
- 1 January 1975
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 22 (1) , 129-144
- https://doi.org/10.1145/321864.321875
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- The synthesis of loop predicatesCommunications of the ACM, 1974
- Inductive methods for proving properties of programsPublished by Association for Computing Machinery (ACM) ,1972
- Implementation and applications of Scott's logic for computable functionsPublished by Association for Computing Machinery (ACM) ,1972
- Implementation and applications of Scott's logic for computable functionsACM SIGPLAN Notices, 1972
- Correctness of a compiler for arithmetic expressionsProceedings of Symposia in Applied Mathematics, 1967
- Assigning meanings to programsPublished by American Mathematical Society (AMS) ,1967
- Proof of algorithms by general snapshotsBIT Numerical Mathematics, 1966
- A Basis for a Mathematical Theory of Computation)Published by Elsevier ,1963
- LISP 1.5 PROGRAMMER'S MANUALPublished by Defense Technical Information Center (DTIC) ,1962