Binding performance at language design time

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn Part F130236, Issue , 1987, Pages 85-97

  Cai, Jiazhen ^a   Paige, Robert ^b  

^a RUTGERS UNIVERSITY   (United States)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PROBLEM ORIENTED LANGUAGES; PROGRAM COMPILERS; SOFTWARE ENGINEERING; SPECIFICATION LANGUAGES; SPECIFICATIONS;

INPUT/OUTPUT; LANGUAGE DESIGN; PERFORMANCE ANALYSIS; PROGRAMMING SYSTEM; RESEARCH GOALS; TIME AND SPACE COMPLEXITY;

PROGRAM TRANSLATORS;

EID: 0037955190     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/41625.41633     Document Type: Conference Paper

References (38)

1. Aho, A., Hopcroft, J., and Ullman, J. Design and Analysis of Computer Algorithms. Addison-Wesley, 1974.
2. Aho, A., Sethi, R., Bind Ullman, J. Compilers. Addison-Wesley, 1986.
3. Bird, R "The Promotion and Accumulation Strategies in Transformational Programming". ACM TOPLAS 6, 4 (Oct. 1984), pp. 487-504.
4. Birkhoff, G. Lattice Theory. American Mathematical Society, Providence, 1966.
5. Cai, J. and Paige, R. Transformational Derivation of Constant Propagation Programs, submitted.
6. Chomsky, N. "On Certain Formal Properties of Grammars". Info, and Control S (1959), 137-167.
7. Dijkstra, E. W. A Discipline of Programming. Prentice-Hall, 1976.
8. Earley, J. "High Level Iterators and a Method for Automatically Designing Data Structure Representation". Journal of Computer Languages J, 4 (1976), 321-342.
9. Gratter, G. General Lattice Theory. Birkhauser, 1978.
10. Gurevich, Y. and Shelah, S. Fixed-point Extensions of First-order Logic. 26th IEEE Symp. on FOCS, 1985.
11. Harel, D. and Koren, D. "A Programming Language for the Inductive Sets, and Applications". Information and Control 63, 2 (1985), 1-27.
12. Harrison, M. Set Comparison Using Hashing Techniques. Tech. Rept. NYO-1480-155, NYU, 1970.
13. Hopcroft, J. and Ullman, J. Introduction to Automata Thtory, Languages, and Computation. Addison-Wesley, 1979.
14. Immerman, N. Relational queries computable in polynomial time. Proc. 14th ACM Symp. on Theory of Computing, May, 1982.
15. Immerman, N. Languages Which Capture Complexity Clasaes. Proc. 15th ACM Symp. on Theory of Computing, April, 1983, pp. 347-354.
16. Knuth, D. "Semantics of Context-free Languages". Mathematical System, Theory 2, 2 (1968).
17. Mehlhorn, K. Data Structures and Algorithms. Volume 1: Sorting and Searching. Spriager-Veriag, 1984.
18. Paige, R. Transformational Programming - Applications to Algorithms and Systems. Proceedings Tenth ACM Symposium on Principles of Programming Languages, Jan, 1983, pp. 73-87.
19. Paige, R. Applications of Finite Differencing to Database Integrity Control and Query / Transaction Optimisation. In Advances In Database Theory, Volums 2, Gallaire, H., Minker, J., and Nicolas, J.-M., Ed., Plenum Press, New York, 1984, pp. 171-210.
20. Paige, R. and Henglein, F. Mechanical Translation of Set Theoretic Problem Specifications Into Efficient RAM Code - A Case Study. EUROCAL 85, 1985, pp. 554-567. Lecture Notes in Computer Science 204.
21. Paige, R., Tarjan, R., and Bonic, R. "A Linear Time Solution to the Single Function Coarsest Partition Problem". TCS 40, 1 (Sep 1985), 67-84.
22. Paige, R- "Programming With Invariants". IEEE Software 3, 1 (Jan, 1986), 56-69.
23. Paige, R. and Schonberg, E. Efficient Set Based Programming, in preparation.
24. Paige, R. and Koenig, S. "Finite Differencing of Computable Expressions". ACM TOPLAS 4, 3 (July 1982), 402-454.
25. Papadimitriou, C. "A Note On The Expressive Power of PROLOG". Bullitin of EATCS £6 (1985), 21-23.
26. Reif, J.H. and Lewis, H.R. Symbolic evaluation and Ihe global value graph. Harvard University, Aiken Computation Laboratory, 1982.
27. Schonberg, E., and Schwarte., J. T., and Sharir, M. "An Automatic Technique for Selection of Data Representations in in SETL Programs". ACM TOPLAS 3, 2 (Apr 1981), 126-143.
28. Schwartt, J. T. On Programming: An Interim Report on the SETL Project, Installments I and II. CIMS, New York Univ., New York, 1974.
29. Schwartt, J.T. "Automatic Data Structure Choice in a Language of Very High Level". CACM 18, 12 (Dec 1975), 722-728.
30. Schwartt, J. T. Correct Program Technology. Tech. Rept. Courant Computer Science Report Num. 12, CIMS, New York University, Sep, 1977.
31. Suppes, P. Ariomatic Set Theory. Dover, 1972.
32. Tarjan, R. Amortised computational complexity. SIAM J. Alg. Disc. Meth. to appear.
33. Tarski, A. "A Lattice-Theoretical Fixpoint Theorem and its Application". Pacific Journal of Mathematics 5 (1955), 285-309.
34. Tenenbaum, A. Type Determination for Very High Level Languages. Ph.D. Th., New York University, Dept. of Computer Science. Oct 1974. appears in Jourant Computer Science Report 3.
35. Vardi, M. Complexity of Relational Query Languages. Proc. 14th ACM Symp. on Theory of Computing, May, 1982, pp. 137-146.
36. Willard, D. Predicate Oriented Database Search Algorithms. Ph.D. Th., Harvard U., 1978.
37. Willard, D. Abstract Predicate Retrieval Theory. State University of New York at Albany, Albany, New York 12222, Aug, 1983.
38. Willard, D. Efficient Processing of Relational Calculus Expressions Using Range Query Theory. Sigmod84, 1984.