Viewing a program transformation system at work

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 844 LNCS, Issue , 1994, Pages 5-24

  Paige, Robert ^a  

^a NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION PROGRAMS; COMPUTER AIDED DESIGN; COMPUTER AIDED SOFTWARE ENGINEERING; COMPUTER CIRCUITS; COMPUTER RESOURCE MANAGEMENT; COMPUTER WORKSTATIONS; DATA HANDLING; DATA STRUCTURES; GENETIC ENGINEERING; GENETIC PROGRAMMING; INFORMATION MANAGEMENT; LOGIC PROGRAMMING; OPERATIONS RESEARCH; RELIABILITY ANALYSIS; RESEARCH AND DEVELOPMENT MANAGEMENT; SEARCH ENGINES; SOFTWARE DESIGN; SOFTWARE RELIABILITY; SUPERCOMPUTERS;

CONVENTIONAL APPROACH; EFFICIENT IMPLEMENTATION; NONNUMERICAL ALGORITHMS; PROGRAM TRANSFORMATION SYSTEMS; PROGRAM TRANSFORMATIONS; RESOURCE UTILIZATIONS; RUN-TIME PERFORMANCE; SOFTWARE DEVELOPMENT METHODOLOGIES;

C (PROGRAMMING LANGUAGE);

EID: 84990717176     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58402-1_3     Document Type: Conference Paper

References (64)

1. A. Aho and J. Unman. Universality Of Data Retrieval Languages. In Proc. ACM 6th POPL, pages 110-117, Jan, 1979.
2. F. Bancilhon. Naive Evaluation of Recursively defined Relations. On Knowledge-Base Management Systems, N, Brodie and H, Mylopoulos, editors, pages 165-178, 1986.
3. F. Bancilhon, and R. Ramakrishnan. An amateur’s introduction to recursive query-processing strategies. In A CM SIGMOD, pages 16-52, 1986.
4. D. Barstow. Knowledge-Based Program Construction, Elsevier North-Holland, 1979.
5. R. Bayer. Query evaluation and recursion in deductive database system, unpub-fished manuscript, 1985.
6. C. Beeri and P. Bernstein. Computational Problems Related to the Design of Normal Form Relation Schemes. ACM TODS, 4:(1):30-59, 1979.
7. R. Bird. An introduction to the theory of fists, in Logic Programming and Calculi of Discrete Design, M. Broy ed., pp. 5-42, NATO ASI Series F, Vol 3, 6, Springer-Verlag, 1987.
8. B. Bloom and R. Paige. Computing Ready Simulations Efficiently. In Proc. First North American Process Algebra Workshop, A. Zwarico and S. Purushothaman, editors, Workshops in Computer Science Series, Springer-Verlag, pages 119-134, 1992.
9. P. Borras, D. Clement, T. Despeyroux, J. Incerpi, B. Lang, and V. Pascual. Centaur: the system. Proc. ACM SIGSOFT/SIGPLAN Software Eng. Syrup. on Pracical Software Dev. Environments, pp. 14-24, 1989.
10. J. Cai and R. Paige. Binding Performance at Language Design Time. In Proc. ACM POPL, pages 85-97, Jan 1987.
11. J. Cai and R. Paige, Look Ma, No Hashing, And No Arrays Neither. In Proc. ACM POPL, pages 143-154, Jan, 1991.
12. J. Cai and R. Paige. Towards Increased Productivity of Algorithm Implementation. In Proc. ACM SIGSOFT, pages 71-78, Dec. 1993.
13. J. Cai and R. Paige. Program Derivation by Fixed Point Computation. Science of Computer Programming, 11:197-261, 1988-1989.
14. J. Cai. A Language for Semantic Analysis. Technical Report 635, Courant Institute/ New York University, 1993.
15. J. Cai, P. Facon, F. Henglein, R. Paige, and E. Schonberg. Type Transformation and Data Structure Choice. In Constructing Programs From Specifications, B. Moeller editor, North-Holland, pages 126-124, 1991.
16. J. Cal, R. Paige, and R. Tarjan. More Efficient Bottom-Up Multi-Pattern Matching In Trees. Theoretical Computer Science, 106:(1):21-60, Nov 1992.
17. J. Cai and R. Paige. Languages Polynomial in the Input Plus Output. In Algebraic Methodology and Software Technology, M. Nivat, C. Rattray, T. Rus, and G. Scollo, editors, Workshops in Computing Series, Springer-Verlag, pages 287-302, 1992.
18. C.-H. Chang and R. Paige. From Regular Expressions to DFA’s Using Compressed NFA’s. In Proc. CPM ‘92, A. Apostolico, M. Crochemore, Z. Galil, and U. Manber, editors, Springer-Verlag, Lecture Notes in Computer Science number 644, pages 88-108, 1992.
19. P. Cousot and R. Cousot. Constructive versions of Tarski’s fixed point theorems. Pacific J. Math., 82:(1):43-57, 1979.
20. H. Curry. Modified basic functionality in combinatory logic. Dialectica, 23:83-92, 1969.
21. R. Dewar, A. Grand, S. C. Liu, J. Schwartz, and E. Schonberg. Program by Refinement as Exemplified by the SETL Representation Sublanguage. TOPLAS, 1:(1):27-49, July 1979.
22. E. W. Dijkstra. A Discipline of Programming, Prentice-Hall, 1976.
23. W. Dowhng and J. Gallier. Linear-Time Algorithms For Testing The Satisfiability of Propositional Horn Formulae. J. Logic Programming, 3:267-284, 1984.
24. J. Earley. Toward an Understanding of Data Structures. CACM, 14:(10):617-627, Oct 1971.
25. J. Earley. High Level Operations in Automatic Programming. In Proc. Syrup. On Very High Level Lungs. Sigplan Notices, 9:(4), Apr, 1974.
26. J. Earley. High Level Iterators and a Method for Automatically Designing Data Structure Representation. J of Computer Languages, 1:(4):321-342, 1976.
27. A. Fong and J. Ullman. Induction Variables in Very High Level Languages. In Proc. Third ACM POPL, pages 104-112, Jan 1976.
28. C. Forgy. RETE, a fast algorithm for the many patterns many objects Match problem. Aritifical Intelligence, 19:17-37, 1982.
29. H. Goldstine. A History of Numerical Analysis, Springer-Verlag, 1977.
30. A. Goldberg and R. Paige. Stream Processing ACM Symposium on LISP and Functional Programming, pp. 53-62, Aug, 1984.
31. L. Henschen and S. Naqvi. On Compiling Queries in Recursive First-order Database. CACM, 31:47-85, 1984.
32. J. Hindley. The principal type-scheme of an object in combinatory logic. J Trans. AMS, 146:29-60, 1969.
33. J. Jeuring. The Derivation of On-Line Algorithms, with an Application to Finding Palindromes. Algorithmica, 11:(2):146-184, Feb 1994.
34. N. Jones, C. Gomard, and P. Sestoft. Partial Evaluation and Automatic Program Generation, Prentice Hall, 1993.
35. E. Kant. Efficiency in Program Synthesis, UMI Research Press, 1981.
36. P. Klint, ed. The ASF+SDF Meta-environment User’s Guide, version 26, 1993.
37. D. Knuth. The Art of Computer Programming, Vol 1: Fundamental Algorithms, Addison-Wesley, 1973.
38. J. Low and P. Rovner. Techniques for the automatic selection of data structures. In Proc Third POPL, pages 58-67, 1976.
39. L. Meertens. Algorithmics-towards programming as a mathematical activity. Proc. CWI Syrup. on Mathematics and Computer Science, J. W. de Bakker, M. Hazewinkel and J.K. Lenstra eds., CWI Monograph Vol 1, North-Holland, 1987.
40. L. Meertens. Incremental Optimum-Fit Line Breaking WG2.1 TR 720 REN-5, Jan 1994.
41. J. Morris and M. Wells. The Specification of program flow in Madcap VI. In Proc. ACM Natl. Conf., pages 755-762, 1972.
42. S. Naqvi and L. Henschen. Synthesizing Least Fixed Point Queries into Nonrecursive Iterative Programs. In Proc. IJCAI 83, pages 25-28, Aug 1983.
43. R. Palge. Programming With Invariants. IEEE Software, 3:(1):56-69, Jan 1986.
44. R. Paige. Real-time Simulation of a Set Machine on a RAM. In Proc. ICCI ‘89, Computing and Information, Vol 2, R. Janicki and W. Koczkodaj, editors, pages 69-73, 1989.
45. R. Paige. Symbolic Finite Differencing-Part I. Proc. ESOP 90, N. Jones ed., Springer-Verlag, Lecture Notes in Computer Science 432, 1990.
46. R. Paige. APRS Reference Manual. unpublished manuscript, 1993.
47. R. Palge. Efficient Translation of External Input in a Dynamically Typed Language. Proc. IFIP Congress 94, 1994.
48. R. Palge and F. Henglein. Mechanical Translation of Set Theoretic Problem Specifications Into Efficient RAM Code-A Case Study. Journal of Symbolic Computation, 4:(2):207-232, Aug., 1987.
49. R. Paige and J. Schwartz. Expression Continuity and the Formal Differentiation of Algorithms. In Proe. 4th ACM POPL, pages 58-71, Jan 1977.
50. Refine User’s Guide Version 3.0, Reasoning Systems, May 1990.
51. P. Rovner. Automatic Representation Selection for Associative Data Structures. Technical Report 10, Dept. of Computer Science, University of Rochester, 1977.
52. E. Schonberg, J. Schwartz, and M. Sharir. An Automatic Technique for Selection of Data Representations in in SETL Programs. A CM TOPLAS, 3:(2):126-143, Apr, 1981.
53. J. Schwartz. Automatic Data Structure Choice in a Language of Very High Level. CACM, 18:(12):722-728, Dec, 1975.
54. J. Schwartz. Optimization of Very High Level Languages, Parts I, II. J. of Computer Languages, 1:(2,3):161-218, 1975.
55. P. Selinger, et al. Access path selection in a relational database management system. In Proc. ACM SIGMOD, pages 23-34, May, 1979.
56. D. Smith. KIDS-A Knowledge-Based Software Development System. Proc. Workshop on Automating Software Design, AAAI-88, pp. 129-136, Sept 1988.
57. D. Smith. private communication, 1991.
58. K. Snyder. The SETL2 Programming Language. Technical Report 490, Courant Institute/ New York University, 1990.
59. K. Snyder private communication, 1993.
60. R. Tarjan. A Class Of Algorithms Which Require Nonlinear Time To Maintain Disjoint Sets. J. Comput. Sys. Sci., 18:110-127, 1979.
61. J. Ullman. Principles of Database and Knowledge-Base Systems, I, Computer Science Press, 1988.
62. M. Wells and J. Morris. The unified data structure capability in Madcap VI. Intl. Journal of Comp. and Info. Sci., 1:(3):193-208, Sept 1972.
63. D. Willard. Abstract Predicate Retrieval Theory. Technical Report 83-3, State University of New York at Albany, Aug, 1983.
64. D. Willard. Quasilinear Algorithms for Processing Relational Calculus Expressions. In Proc. ACM PODS, pages 243-257, 1990.