Skip to main content
SpringerLink
Log in

Research Retrospective

  • Published:
Higher-Order and Symbolic Computation

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Bloom, B. Ready simulation, bisimulation, and the semantics of CCS-like languages. Ph.D. Thesis, Massachusetts Institute of Technology, 1989.

  2. Bloom, B. and Paige, R. Transformational design and implementation of a new efficient solution to the ready simulation problem. Science of Computer Programming, 24(3) (1995) 189–220.

    Google Scholar 

  3. Cai, J. and Paige, R. Binding performance at language design time. In Proceedings of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, M.J. O'Donnell (Ed.). ACM Press, München, West Germany, 1987, pp. 85–97.

    Google Scholar 

  4. Cai, J. and Paige, R. Program derivation by fixed point computation. Science of Computer Programming, 11(3) (1989) 197–261.

    Google Scholar 

  5. Cai, J. and Paige, R. Towards increased productivity of algorithm implementation. In Proc. ACM SIGSOFT FSE, 1993, pp. 71–78.

  6. Cai, J. and Paige, R. Using multiset discrimination to solve language processing problems without hashing. Theoretical Computer Science, 145(1–2) (1995) 189–228.

    Google Scholar 

  7. Chang, C.-H. and Paige, R. From regular expressions to DFA's using compressed NFA's. Theoretical Computer Science, 178(1/2) (1997) 1–36.

    Google Scholar 

  8. Dowling W.F. and Gallier, J. Linear-time algorithms for testing the satisfiability of propositional horn formulae. Journal of Logic Programming, 1(3) (1984) 267–284.

    Google Scholar 

  9. Goyal, D. and Paige, R. The formal reconstruction and improvement of the linear time fragment of Willard's relational calculus subset. In Algorithmic Languages and Calculi, R. Bird and L. Meertens (Eds.). Chapman & Hall, 1997, pp. 382–414.

  10. Hecht, M.S. Flow Analysis of Computer Programs, Elsevier North-Holland, 1977.

    Google Scholar 

  11. Keller, J.P. and Paige, R. Program derivation with verified transformations—A case study. CPAM, 48(9/10) (1996) 1053–1113.

    Google Scholar 

  12. Knuth, D.E. The Art of Computer Programming, Volume II: Seminumerical Algorithms. Addison-Wesley, 1969.

  13. Koenig, S. and Paige, R. A transformational framework for the automatic control of derived data. In Proceedings of the 7th International Conference on Very Large Data Bases. Cannes, France, 1981, pp. 306–318.

    Google Scholar 

  14. Paige, R. Formal Differentiation. UMI Research Press, 1981.

  15. Paige, R. and Henglein, F. Mechanical translation of set theoretic problem specifications into efficient RAM code-A case study. Journal of Symbolic Computation, 4(2) (1987) 207–232.

    Google Scholar 

  16. Paige, R. and Koenig, S. Finite differencing of computable expressions. ACM Transactions on Programming Languages and Systems, 4(3) (1982) 402–454.

    Google Scholar 

  17. Paige, R., Tarjan, R.E. and Bonic, R. A linear time solution to the single function coarsest partition problem. Theoretical Computer Science, 40(1) (1985) 67–84.

    Google Scholar 

  18. Paige, R. and Yang, Z. High Level reading and data structure compilation. In Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Programming Languages, N.D. Jones (Ed.). ACM Press, Paris, France, 1997, pp. 456–469.

    Google Scholar 

  19. Reif, J.H. and Lewis, H.R. Symbolic evaluation and the global value graph. In Proceedings of the Fourth Annual ACM Symposium on Principles of Programming Languages, R. Sethi (Ed.). ACM Press, 1977, pp. 104–118

Download references

Author information

Authors and Affiliations

  1. New York University, USA

    Bob Paige

Authors
  1. Bob Paige
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Paige, B. Research Retrospective. Higher-Order and Symbolic Computation 16, 7–13 (2003). https://doi.org/10.1023/A:1023011918666

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1023011918666

Keywords

Search

Navigation