Future Directions in Program Transformations

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 32, Issue 1, 1997, Pages 94-98

  Paige, R ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0005256709     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/251595.251609     Document Type: Article

References (26)

1. ANDERSSON, A. 1995. Sublogarithmic searching without multiplications. In 36th Annual Symposium on Foundations of Computer Science (Milwaukee, Wisconsin, 1995), pp. 655-663. IEEE.
2. BORRAS, P., CLEMENT, D., DESPEYROUX, T., INCERPI, J., KAHN, G., LANG, B., AND PASCUAL, V. 1987. Centaur: the system. Rapports de Recherche 777, INRIA.
3. BRODAL, G. AND OKASAKI, C. 1996. Optimal purely functional priority queues. Journal of Functional Programming 6, 6 (Dec.).
4. CAI, J., FACON, P., HENGLEIN, F., PAIGE, R., AND SCHONBERG, E. 1991. Type transformation and data structure choice. In B. MOELLER Ed., Constructing Programs From Specifications, pp. 126-164. Amsterdam: North-Holland.
5. CAI, J. AND PAIGE, R. 1995. Using multiset discrimination to solve language processing problems without hashing. Theoretical Computer Science 145, 1-2 (July), 189-228. URL http://cs.nyu.edu/cs/faculty/paige/papers/hash.ps.
6. CAI, J. AND PAIGE, R. Dec. 1993. Towards increased productivity of algorithm implementation. In Proc. ACM SIGSOFT (Dec. 1993), pp. 71-78.
7. COCKE, J. AND KENNEDY, K. 1977. An algorithm for reduction of operator strength. CACM 20, 11 (Nov.), 850-856.
8. COUSOT, P. AND COUSOT, R. 1977. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixed points. In Proc. 4th ACM Symp. on Principles of Programming Languages (1977), pp. 238-252.
9. DRISCOLL, J., SARNAK, N., SLEATOR, D., AND TARJAN, R. 1986. Making data structures persistent. In Proc. 8th ACM STOC (May 1986), pp. 109-121.
10. FERRANTE, J. AND OTTENSTEIN, K. J. 1983. A program form based on data dependency in predicate regions (Austin, Tex., Jan. 1983). pp. 217-236.
11. FONG, A. AND ULLMAN, J. 1976. Induction variables in very high level languages. In Proc. Third ACM Symp. on Principles of Programming Languages (Jan. 1976), pp. 104-112.
12. FREDMAN, M. AND WILLARD, D. 1994. Surpassing the information theoretic barrier with fusion trees. J. Comput. Sys. Sci. 48, 533-551.
13. GOYAL, D. AND PAIGE, R. 1997. The formal reconstruction and improvement of the linear time fragment of Willard's relational calculus subset. In IFIP TC2 Working Conf. on Algorithmic Languages and Calculi (1997).
14. JEURING, J. 1994. The derivation of on-line algorithms, with an application to finding palindromes. Algorithmica 11, 2 (Feb.), 146-184.
15. JONES, N., GOMARD, C., AND SESTOFT, P. 1993. Partial Evaluation and Automatic Program Generation. Prentice-Hall.
16. KELLER, J. AND PAIGE, R. 1995. Program derivation with verified transformations - a case study. CPAM 48, 9-10, 1053-1113.
17. KOENIG S. AND PAIGE, R. 1981. A transformational framework for the automatic control of derived data. In Proc. 7th Intl. Conf. on VLDB (Sep 1981), pp. 306-318.
18. PAIGE, R. 1986. Programming with invariants. J IEEE Software 3, 1 (Jan). 56-69.
19. PAIGE, R. 1989. Real-time simulation of a set machine on a ram. In N. JANICKI AND W. KOCZKODAJ Eds., Computing and Information, Volume II, pp. 69-73. Toronto: Canadian Scholars' Press.
20. PAIGE, R. AND KOENIG, S. 1982. Finite differencing of computable expressions. ACM Trans. on Programming Languages and Systems 4, 3, 401-454.
21. PAIGE, R., REIF, J., AND WACHTER, R. Eds. 1993. Parallel Algorithm Derivation and Program Transformation. Kluwer.
22. PAIGE, R., TARJAN, R., AND BONIC, R. 1985. A linear time solution to the single function coarsest partition problem. Theoretical Computer Science 40, 1 (Sep.), 67-84.
23. PEPPER, P. AND WIRSING, M. 1994. Korso: A methodology for the development of correct software. Technical Report 93-36 (Nov.), TU Berlin.
24. REPS, T. AND TEITELBAUM, T. 1989. The Synthesizer Generator: A System for Constructing Language-Based Editors. Springer-Verlag, New York.
25. SNYDER, K. 1990. The SETL2 programming language. Technical Report 490, Courant Insititute, New York University.
26. WATSON, B. 1993. A taxonomy of finite automata minimization algorithms. Computing Science Note 93/44 (Dec.), Eindhoven University of Technology, Department of Mathematics and Computing Science, Eindhoven, The Netherlands.