Program derivation by fixed point computation
- 30 April 1989
- journal article
- Published by Elsevier in Science of Computer Programming
- Vol. 11 (3) , 197-261
- https://doi.org/10.1016/0167-6423(88)90033-0
Abstract
No abstract availableKeywords
This publication has 49 references indexed in Scilit:
- Mechanical translation of set theoretic problem specifications into efficient RAM code-A case studyJournal of Symbolic Computation, 1987
- Monotone versus positiveJournal of the ACM, 1987
- Finite Differencing of Computable ExpressionsACM Transactions on Programming Languages and Systems, 1982
- Some Observations Concerning Formal Differentiation of Set Theoretic ExpressionsACM Transactions on Programming Languages and Systems, 1982
- An Automatic Technique for Selection of Data Representations in SETL ProgramsACM Transactions on Programming Languages and Systems, 1981
- Constructive versions of Tarski’s fixed point theoremsPacific Journal of Mathematics, 1979
- Global Data Flow Analysis and Iterative AlgorithmsJournal of the ACM, 1976
- High level iterators and a method for automatically designing data structure representationComputer Languages, 1975
- Automatic data structure choice in a language of very high levelCommunications of the ACM, 1975
- A lattice-theoretical fixpoint theorem and its applicationsPacific Journal of Mathematics, 1955