Towards increased productivity of algorithm implementation
- 1 December 1993
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 18 (5) , 71-78
- https://doi.org/10.1145/256428.167067
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- A theory of type polymorphism in programmingPublished by Elsevier ,2003
- Program derivation by fixed point computationScience of Computer Programming, 1989
- Mechanical translation of set theoretic problem specifications into efficient RAM code-A case studyJournal of Symbolic Computation, 1987
- Finite Differencing of Computable 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
- Computational problems related to the design of normal form relational schemasACM Transactions on Database Systems, 1979
- Programming by Refinement, as Exemplified by the SETL Representation SublanguageACM Transactions on Programming Languages and Systems, 1979
- Automatic data structure choice in a language of very high levelCommunications of the ACM, 1975
- Semantics of context-free languagesTheory of Computing Systems, 1968
- A note on two problems in connexion with graphsNumerische Mathematik, 1959