Bancilhon, F. Naive evaluation of recursively defined relations. On Knowledge-Base Management Systems, M. Brodie and J. Mylopoulos (Eds.). McGraw-Hill, 1986, pp. 165–178.
Bayer, R. Query evaluation and recursion in deductive database system, 1985. unpublished manuscript.
Bloom, B. Ready simulation, bisimulation, and the semantics of CCS-like languages. PhD thesis, Massachusetts Institute of Technology, Sept. 1989.
Bloom, B. and Paige, R. Transformational design and implementation of a new efficient solution to the ready simulation problem. Science of Computer Programming
(3) (1995), 189–220. http://cs.nyu.edu/cs/faculty/paige/papers/readysc.ps
Borras, P., Clement, D., Despeyroux, T., Incerpi, J., Kahn, G., Lang, B., and Pascual, V. Centaur: the system. Rapports de Recherche 777, INRIA, 1987.
Cai, J. A language for semantic analysis. Technical Report 635, Courant Institute, New York University, 1993.
Cai, J., Facon, P., Henglein, F., Paige, R., and Schonberg, E. Type transformation and data structure choice. In Constructing Programs From Specifications,
B. Moeller, (Ed.). North-Holland, Amsterdam, 1991, pp. 126–164. http://cs.nyu.edu/cs/faculty/paige/papers/subtype.ps
Cai, J. and Paige, R. Binding performance at language design time. In Proc. Fourteenth ACM Symp. on Principles of Programming Languages, 1987, pp. 85–97.
Cai, J. and Paige, R. Program derivation by fixed point computation. Science of Computer Programming
(3) (1988/1989) 197–261. http://cs.nyu.edu/cs/faculty/paige/papers/fixpoint.ps
Cai, J. and Paige, R. Languages polynomial in the input plus output. In Algebraic Methodology and Software Technology, M. Nivat, C. Rattray, T. Rus, and G. Scollo, (Eds.,) Workshops in Computing, Springer-Verlag, Conference Record of the Second AMAST, 1992, pp. 287–302.
Cai, J. and Paige, R. Using multiset discrimination to solve language processing problems without hashing. Theoretical Computer Science
(1–2) (1995) 189–228. http://cs.nyu.edu/cs/faculty/paige/papers/hash.ps
Cai J. and Paige, R. Towards increased productivity of algorithm implementation. In Proc. ACM SIGSOFT,
(1993), pp. 71–78. http://cs.nyu.edu/cs/faculty/paige/papers/prod.ps
Cai, J., Paige, R., and Tarjan, R. More efficient bottom-up multi-pattern matching in trees. Theoretical Computer Science, 106(1) (1992) 21–60. file://cs.nyu.edu/pub/tech-reports/tr604.ps.Z.
Cantali, A. Using ETNA to prove correctenss and complexity of a linear time implementation of a subset of Willard’s RCS. Bachelor’s thesis, University of Catania, Catania, Italy, 1997.
Chang C.-H. and Paige, R. From regular expressions to DFA’s using compressed NFA’s. Theoretical Computer Science
(1–2) (1997) 1–36. http://cs.nyu.edu/cs/faculty/paige/papers/cnnfa.ps
Cousot P. and Cousot, R. Constructive versions of Tarski’s fixed point theorems. Pacific J. Math., 82(1) (1979) 43–57.
Curry, H. Modified basic functionality in combinatory logic. Dialectica, 23 (1969) 83–92.
Donzeau-Gouge, V., Huet, G., Kahn, G., and Lang, B. Programming environments based on structured editors: The mentor experience. In Interactive Programming Environments. McGraw-Hill, 1984.
Dowling W. and Gallier, J. Linear-time algorithms for testing the satisfiability of propositional horn formulae. J. Logic Programming
(3) (1984), 267–284.CrossRef
Earley, J. High level iterators and a method for automatically designing data structure representation. J. of Computer Languages
(4) 1976, 321–342.CrossRef
Fong A. and Ullman, J. Induction variables in very high level languages. In Proc. Third ACM Symp. on Principles of Programming Languages, Jan. 1976, pp. 104–112.
Forgy, C. RETE, a fast algorithm for the many patterns many objects match problem. Artificial Intelligence, 19
(3) (1982) 17–37CrossRef
Goldberg A. and Paige, R. Stream processing. In Proceedings of the ACM Symposium on LISP and Functional Programming, ACM, 1984, pp. 53–62.
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. http://cs.nyu.edu/phd_students/deepak/lrcs.ps
Goyal D. and Paige, R. A new solution to the hidden copy problem. In Proc. 5th International Static Analysis Symposium
. G. Levi (Ed.) number 1503 in LNCS, Springer, September 1998, pp. 327–348. http://cs.nyu.edu/phd_students/deepak/copy.ps
Hindley, R. The principal type-scheme of an object in combinatory logic. Trans. Amer. Math. Soc., 146 (1969) 29–60
Jones, N., Gomard, C., and Sestoft, P. Partial Evaluation and Automatic Program Generation. Prentice-Hall, 1993.
Keller, J. and Paige, R. Program derivation with verified transformations—a case study. CPAM
(9–10) (1996) 1053–1113 http://cs.nyu.edu/cs/faculty/paige/papers/ltmjform.ps
Klint, P. The ASF+SDF meta-environment user’s guide, version 26. Technical report, Centrum voor Wiskunde en Informatica, 1993.
Knuth, D. The Art of Computer Programming. 3 Vol. Addison-Wesley, 1968–1972.
Koenig, S. and Paige, R. A transformational framework for the automatic control of derived data. In Proc. 7th Intl. Conf. on VLDB, Sep 1981, pp. 306–318
Launchbury, J. and Holst, C.K. Handwriting cogen to avoid problems with static typing. In Draft Proceedings, Fourth Annual Glasgow Workshop on Functional Programming. C.K.H.R. Heldal and P. Wadler (Eds.) Workshops in Computing, Skye, Scotland, 1991. S-V, pp. 210–218.
Liu, Y. Principled strength reduction. In Algorithmic Languages and Calculi. R. Bird and L. Meertens (Eds.) Chapman & Hall, 1997, pp. 357–381.
Paige, R. Formal Differentiation. UMI Research Press, 1981.
Paige, R. Programming with invariants. J IEEE Software, 3(1) 1986. 56–69,
Paige, R. Real-time simulation of a set machine on a RAM. In Computing and Information
. N. Janicki and W. Koczkodaj (Eds.). volume II of ICCI 89
, Canadian Scholars’ Press, Toronto, May 1989, pp. 69–73. http://cs.nyu.edu/cs/faculty/paige/papers/realtime.ps
Paige, R. Viewing a program transformation system at work. In Programming Language Implementation and Logic
, M. Hermenegildo and J. Penjam, (eds.), volume 844 of LNCS
, pages 5–24. Springer-Verlag, Berlin, Sep. 1994. http://cs.nyu.edu/cs/faculty/paige/papers/viewing.ps
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.
Paige, R., Tarjan, R., and Bonic, R. A linear time solution to the single function coarsest partition problem. Theoretical Computer Science
(1) (1985) 67–84CrossRef
Paige R. and Yang, Z. High level reading and data structure compilation. In Proc. 24th ACM Symp. on Principles of Programming Languages
, pp. 456 –469, 1997. http://cs.nyu.edu/phd_students/zheyang/papers/read.ps
Refine user’s guide version 3.0, 1990.
Reif J. and Lewis, H. Symbolic evaluation and the global value graph. In Proc. 4th Annual ACM Symp. on Principles of Programming Languages, 1997, pp. 104–118
Reps, T. and Teitelbaum, T. The Synthesizer Generator: A System for Constructing Language-Based Editors. Springer-Verlag, New York, 1989.
Reps, T., Teitelbaum, T., and Demers, A. Incremental context-dependent analysis for language-based editors. ACM TOPLAS
(3) (1983) 449–477CrossRef
Schwartz, J. Automatic data structure choice in a language of very high level. CACM, 18(12) (1975) 722–728.
Schwartz, J. Optimization of very high level languages, parts I, II. J. of Computer Languages
(2–3) (1975) 161–218.CrossRef
Schwartz, J., Dewar, R., Dubinsky, E., and Schonberg, E. Programming with Sets: An Introduction to SETL. Springer-Verlag, New York, 1986.
Smith, D. Kids—a semi-automatic program development system. IEEE Transactions on Software Engineering, (1990) 129–136.
Snyder, K. The SETL2 programming language. Technical Report 490, Courant Insititute, New York University, 1990.
Tarski, A. A lattice-theoretical fixpoint theorem and its application. Pacific J. of Mathematics, 5 (1955) 285–309.
Ullman, J. Principles of Database and Knowledge-Base Systems. Computer Science Press, 1988.
van der Meulen, E. Incremental rewriting. PhD thesis, CWI, 1994.
Willard, D.E. Predicate retrieval theory. Technical Report 83-3, SUNY Albany, 1983.
Willard, D.E. Quasi-linear algorithms for processing relational data base expressions. In Proceedings of the 9th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1990, pp. 243–257.
Willard, D. E. Applications of range query theory to relational data base join and selection operations. J. Computer and System Sci.
Yang, Z. Encoding types in ML-like languages. In P. Hudak and C. Queinnec, Proceedings of the 1998 ACM SIGPLAN International Conference on Functional Programming (Eds.), Baltimore, Maryland, USA, Sept. ACM Press, 1998, pp. 289–300
Yang, Z. A native ML implementation of type-directed partial evaluation. In Proceedings of the 1998 APPSEM Workshop on Normalization by Evaluation, NBE ‘98. O. Danvy and P. Dybjer, (Eds.). Göteborg, Sweden, May 8–9, 1998, number NS-98-1 in BRICS Notes Series, BRICS, Department of Computer Science, University of Aarhus, May 1998.