Finite Differencing of Computable Expressions
- 1 July 1982
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 4 (3), 402-454
- https://doi.org/10.1145/357172.357177
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Some Observations Concerning Formal Differentiation of Set Theoretic ExpressionsACM Transactions on Programming Languages and Systems, 1982
- A Unified Approach to Path ProblemsJournal of the ACM, 1981
- An Automatic Technique for Selection of Data Representations in SETL ProgramsACM Transactions on Programming Languages and Systems, 1981
- Programming by Refinement, as Exemplified by the SETL Representation SublanguageACM Transactions on Programming Languages and Systems, 1979
- An algorithm for reduction of operator strengthCommunications of the ACM, 1977
- A Transformation System for Developing Recursive ProgramsJournal of the ACM, 1977
- High level iterators and a method for automatically designing data structure representationComputer Languages, 1975
- An axiomatic basis for computer programmingCommunications of the ACM, 1969