Robert Paige
- 1 AHO, A., AND ULLMAN, J. Principles of Compiler Design. Addison-Wesley, Reading, Mass., 1978. Google Scholar
- 2 ALLEN, F.E. Program optimization. Annu. Rev. Aurora. Program. 5 (1969), 239-307.Google Scholar
- 3 ALLEN, F.E., COCKE, J., AND KENNEDY, K. Reduction of operator strength. In Program Flow Analysis, S. Muchnick and N. Jones (Eds.). Prentice-Hall, Englewood Cliffs, N.j., 1981, pp. 79-101.Google Scholar
- 4 BAUER, F.L., ANI) THE C.I.P. LANGUAGE GROUP. Report on a wide spectrum language for program specification and development. Tech. Rep. TUM-I8104, Institut f/Jr informatik, Technische Universitiit Miinchen, M, mich, W. Germany, May 1981.Google Scholar
- 5 BROY, M., PARTSCH, H., PEPPER, P., AND WIRSING, M. Semantic relations in programming languages. In Information Processing 80 (1980), 101-106.Google Scholar
- 6 BVRGE, W. An optimizing technique for high level programming languages. Computer Science Tech. Rep. RC 5834, #25271, IBM Research Center, Yorktown Heights, N.Y., 1976.Google Scholar
- 7 BURSTALL, R.M., ANO DARLINGTON, J. A transformation system for developing recursive programs. J. ACM 24, 1 (Jan. 1977), 44-67. Google Scholar
- 8 COCKE, J., AND KENNEDY, K. An algorithm for reduction of operator strength. Commun. ACM 20, 11 (Nov. 1977), 850-856. Google Scholar
- 9 COCKE, J., A~D MARKSTEIN, P. Strength reduction for division and modulo with application to accessing a multilevel store. Computer Science Tech. Rep. RC 7013, #30059, IBM Research Center, Yorktown Heights, N.Y., 1978.Google Scholar
- 10 COCKE, J., ANO SC~WAR?Z, J.T. Programming languages and their compilers. Lecture notes, Courant Institute of Mathematical Sciences, New York Univ., New York, N.Y., 1969. Google Scholar
- 11 DEWAR, R.B.K. The SETL programming language. Unpublished manuscript.Google Scholar
- 12 DEWAR, R.B.K., GRAND, A., LIV, S.-C., SCHWARTZ, J.T., AND SCHONBERG, E. Programming by refinement, as exemplified by the SETL representation sublanguage. A CM Trans. Program. Lang. Syst. 1, 1 (July I979), 27-49. Google Scholar
- 13 EARLEY, J. High level iterators and a method for automatically designing data structure representation. Comput. Lang. 1, 4 (1975), 321-342.Google Scholar
- 14 FEATHER, M.S. A System for Developing Programs by Transformation. Ph.D. dissertation, Dep. of Artificial Intelligence, Univ. of Edinburgh, Edinburgh, Scotland, 1979.Google Scholar
- 15 FONG, A.C. Inductively computable constructs in very high level languages. In Conference Record of the 6th Annual ACM Symposium on Principles of Programming Languages, San Antonio, Tex., Jan. 29-31, 1979, pp. 21-28. Google Scholar
- 16 FoNG, A.C. Generalized common subexpressions in very high level languages. In Conference Record of the 4th ACM Symposium on Principles of Programming Languages, Los Angeles, Calif., Jan. 17-19, 1977, pp. 48-57. Google Scholar
- 17 FoNG, A.C., AND ULLMAN, J.D. Induction variables in very high level languages. In Conference Record of the 3d ACM Symposium on Principles of Programming Languages, Atlanta, Ga., Jan. 19-21, 1976, pp. 104-112. Google Scholar
- 18 FREUDENBERGER, S.M. SETL data structures. SETL Newsl. 189B, Dep. of Computer Science, New York Univ., New York, N.Y., May 1980.Google Scholar
- 19 GAREY, M.R., AND JOHNSON, D.S. Computers and Intractability. W.H. Freeman, San Francisco, 1979.Google Scholar
- 20 GERHAR?, S.L. Correctness-preserving program transformations. In Conference Record of the 2d ACM Symposium on Principles of Programming Languages, Palo Alto, Calif., Jan. 20-22, 1975, pp. 54-66. Google Scholar
- 21 GOLDSTINE, H.H. A History of Numerical Analysis. Springer-Verlag, New York, 1977.Google Scholar
- 22 GOLDSTINE, H.H. The Computer from Pascal to Von Neurnann. Princeton Univ. Press, Princeton, N.j., 1972. Google Scholar
- 23 HECHT, M. Flow Analysis of Computer Programs. Elsevier North-Holland, New York, 1977. Google Scholar
- 24 HOARE, C.A.R. An axiomatic basis for computer programming. Commun. ACM 12, 10 (Oct. 1969), 576-580, 583. Google Scholar
- 25 KENNEDY, K. A survey of compiler optimization techniques. In Program Flow Analysis, S. Muchnick and N. Jones (Eds.). Prentice-Hall, Englewood Cliffs, N.J., 1981, pp. 5-54.Google Scholar
- 26 KENNEDY, K. Variable subsumption with constant folding. SETL Newsl. 123, Dep. of Computer Science, New York Univ., New York, N.Y., Feb. 1974.Google Scholar
- 27 KENNEDY, K. Global dead computation elimination. SETL Newsl. 111, Dep. of Computer Science, New York Univ., New York, N.Y., Aug. 1973.Google Scholar
- 28 KENNEDY, K. An algorithm to compute compacted use definition chains. SETL Newsl. 112, Dep. of Computer Science, New York Univ., New York, N.Y., Aug. 1973.Google Scholar
- 29 KENNEDY, K. Linear function test replacement. SETL Newsl. 107, Dep. of Computer Science, New York Univ., New York, N.Y., May 1973.Google Scholar
- 30 KENNEDY, K. Reduction in strength using hashed temporaries. SETL Newsl. 102, Dep. of Computer Science, New York Univ., New York, N.Y., Mar. 1973.Google Scholar
- 31 KOENIG, S., AND PAIGE, R. A transformational framework for the automatic control of derived data. In Proceedings, 7th International Conference on Very Large Data Bases, Cannes, France, Sept. 9-11, 1981, pp. 306-318.Google Scholar
- 32 MORCENSTERN, M. Automated Design and Optimization of Management Information System Software. Ph.D. dissertation, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, Mass., Sept. 1976.Google Scholar
- 33 PAICE, R. Formal Differentiation. UMI Research Press, Ann Arbor, Mich., 1981. Revision of Ph.D. dissertation, Dep. of Computer Science, New York Univ., New York, N.Y., June 1979.Google Scholar
- 34 PAIGE, R., A~D KOENiG, S. Finite differencing of computable expressions. Tech. Rep. LCSR- TR-8, Dep. of Computer Science, Rutgers Univ., New Brunswick, N.J., Aug. 1980.Google Scholar
- 35 PAIGE, R., AND SCHWARTZ, J.T. Expression continuity and the formal differentiation of algorithms. In Conference Record of the 4th ACM Symposium on Principles of Programming Languages, Los Angeles, Calif., Jan. 17-19, 1977, pp. 58-71. Google Scholar
- 36 ROSEN, B.K. Degrees of availability. In Program Flow Analysis, S. Muchnick and N. Jones (Eds.). Prentice-Hall, Englewood Cliffs, N.J., 1981, pp. 55-76.Google Scholar
- 37 SCHONBERC, E., SCHWARTZ, J.T., AND SHAreR, M. An automatic technique for selection of data representations in SETL programs. ACM Trans. Program. Lang. Syst. 3, 2 (Apr. 1981), 126-143. Google Scholar
- 38 SCHWARTZ, J.T. Correct program technology. Courant Computer Science Rep. 12, Dep. of Computer Science, New York Univ., New York, N.Y., Sept. 1977.Google Scholar
- 39 SCHWARTZ, J.T. On the "base form" of algorithms. SETL Newsl. 159, Dep. of Computer Science, New York Univ., New York, N.Y., Nov. 1975.Google Scholar
- 40 SCHWARTZ, J.T. Optimization of very high level languages, parts I and II. Comput. Lang. 1, 2-3 (1975), 161-218.Google Scholar
- 41 SCHWARTZ, J.T. On Programming' An Interim Report on the SETL Project, Installments I and H. Courant Institute of Mathematical Sciences, New York Univ., New York, N.Y., 1974.Google Scholar
- 42 SCHWARTZ, J.T. Structureless programming, or the notion of "rubble," and the reduction of programs to rubble. SETL Newsl. 135A, Dep. of Computer Science, New York Univ., New York, N.Y., July 1974.Google Scholar
- 43 SHARm, M. Some observations concerning formal differentiation of set theoretic expressions. A CM Trans. Program. Lang. Syst. 4, 2 (Apr. 1982), 196-225. Google Scholar
- 44 SRIDHARAN, N. Private communication, 1980.Google Scholar
- 45 STANDISH, T., HARRIMAN, D., KIBLER, D., AND NEIGHBORS, J. The Irvine program transformation catalogue. Tech. Rep., Dep. of Information and Computer Science, Univ. of California, Irvine, Irvine, Calif., Jan. 1976.Google Scholar
- 46 TARJAN, R.E. A unified approach to path problems. J. ACM 28, 3 (July 1981), 577-593. Google Scholar
- 47 TENENBAUM, A. Type Determination for Very High Level Languages. Ph.D. dissertation, Dep. of Computer Science, New York Univ., New York, N.Y., Oct. 1974; also in Courant Computer Science Rep. 3, Dep. of Computer Science, New York Univ., New York, N.Y., Oct. 1974. Google Scholar
Index Terms
- Finite Differencing of Computable Expressions
Recommendations
Current differencing transconductance amplifier (CDTA) with enhanced performance and its application
A CMOS current differencing transconductance amplifier (CDTA) with high transconductance has been proposed. The transconductance (gm) of CDTA is generally increased either by increasing the biasing current IB or by increasing the size of transistors ...
A transconductance boosted CMOS current differencing transconductance amplifier (TBCDTA) and its application
This paper presents a transconductance (gm) boosted CMOS current differencing transconductance amplifier (TBCDTA). The transconductance amplifier of CDTA has been modified in TBCDTA, which results in higher and wide range of transconductance with power ...
Bulk-Driven Current Differencing Transconductance Amplifier
Low-voltage (LV) low-power (LP) integrated circuit design is becoming a leading trend in VLSI technology, particularly in special portable applications. In this paper, the principle of a bulk-driven MOS transistor is employed in the design of a novel LV ...
Comments