Uday S. Reddy
- 1.BALZER, R., CHEATHAM, E.J., AND GREEN, C. Software technology in the 1990's: Using a new paradigm. IEEE Computer 16 (Nov. 1983), 39-45.Google Scholar
Digital Library
- 2.BALZER, R., GOLDMAN, N. M., AND WILE, D. S. On the transformational approach to programming. In Proc. 2nd Intern. Conf. on Softw. Eng. (19761, IEEE, pp. 337-344. Google ScholarDigital Library
- 3.BURSTALL, R. M., AND DARLINGTON, J. A transformation system for developing recursive programs. J. ACM 24, 1 (Jan. 1977), 44-67. Google ScholarDigital Library
- 4.CHEATHAM, T. E., HOLLOWAY, G. H., AND TOWNLEY, J. A. Symbolic evaluation and the analysis of programs. IEEE Trans. Softw. Eng. SE-5, 4 (July 1979), 402-417.Google ScholarDigital Library
- 5.CLARKE, L. A. A system to generate test data and symbolically execute programs. IEEE Trans. Softw. Eng. SE-2 , (Sep 1976), 21'5-222.Google Scholar
- 6.COLMERAUER, A., KANOURI, H., PASERO, R., AND Rous- SEL, P. Un Systeme de Communication Homme-machine en Francais. Research Report, Groupe Intelligence Axtificielle, Universite Aix-Marseille II, 1973.Google Scholar
- 7.CONSTABLE, R. Constructive mathematics and automatic program writers. In IFIP (Ljublijana, .Yugoslavia, Aug. 1971), pp. 229-233.Google Scholar
- 8.DARLINGTON, J. Transforming specifications into efficient programs. In IFIP Working G&p 2.1 Conf. on Softw. Specifications (St. Pierre-de-Chatreuse, France., 1976).Google Scholar
- 9.DARLINGTON, J. The structured description of algorithm derivations. In Algorithmic Languages, J. W. de Bakker and J. C. van Vliet, Eds., North-Holland, 1981, pp. 221-250.Google Scholar
- 10.DERSHOWITZ, N. Synthesis by completion. In IJCAI (Los Angeles, 1985), pp. 208-214.Google Scholar
- 11.DERSHOWITZ, N., AND PLAISTED, D. A. Logic programming cum applicative progr amming. In Symposium on Logic PTogmmming (1985), IEEE.Google Scholar
- 12.FEATHER, M. S. A System GOT Developing Programs by Transfonation. PhD thesis, Univ. of Edinburgh, 1979.Google Scholar
- 13.FEATHER, M. S. A system for assisting program transformation. ACM Trans. Program. Lang. Syst. 4, 1 (1982), l-20. Google ScholarDigital Library
- 14.GOGUEN, J. A., AND MESEGUER, J. Equality, types, modules and generics for logic programming. In Pmt. 2nd Intern. Logic Prog. Conf., Uppsala (1984), pp. 115-125.Google Scholar
- 15.GUTTAG, J. V., AND HORNING, J. J. Report on the Larch shared language. Science of Computer Programming 6, 2 (March 1986), 103-157. Google ScholarDigital Library
- 16.HAMMERSLAG, D. Treemacs Manual. Tech. Rep. UHJCDCS-R-88-1427, Univ. Illinois at Urbana-Champaign, May 1988.Google Scholar
- 17.HAMMERSLAG, D. H., KAMIN, S. N., AND CAMPBELL, R. H. Tree-oriented interactive processing with an application to theorem-proving. In Second Conf. on Softw. Dew. Tools, Techniques, and Alternatives (1985), IEEE Computer Society Press, pp. 199-206. Google ScholarDigital Library
- 18.HUET, G., AND OPPEN, D. C. Equations and rewrite rules: a survey. In Formal Language Theory: Perspectives and Open Problems, R. Book, Ed., Academic Press, New York, 1980, pp. 349-405.Google ScholarCross Ref
- 19.KOWALSKI, R. A. Logic for Problem Solving. North- Holland, 1979. Google ScholarDigital Library
- 20.MANNA, Z., AND WALDINGER, R. Synthesis: Dreams =$ programs. IEEE Trans. Softwarn Engineering SE-S, 4 (1979), 294-328.Google ScholarDigital Library
- 21.MANNA, Z., AND WALDINGER, R. A deductive approach to program synthesis. ACM Trans. Pmgmm. Lang. Syst. 2, 1 (Jan. 1980), 90-121. Google ScholarDigital Library
- 22.MILNER, R. A proposal for Standard ML. In ACM Symp. on LISP and Functional Program. (1984), pp. 184-197. Google ScholarDigital Library
- 23.O'DONNELL, M. J. Equational Logic as u Programming Languuge. MIT Press, 1985. Google ScholarDigital Library
- 24.PEYTON-JONES, S. L. The Implementation of Functional Programming Languages. Prentice-Hail International, 1987.Google Scholar
- 25.REDDY, U. S. Narrowing as the operational semantics of functional languages. In Symp. on Logic Pmgram. (Boston, 1985), IEEE, pp. 138-151.Google Scholar
- 26.REDDY, U. S. On the relationship between logic and functional languages. In Logic Programming: Functions, Relations and Equations, D. DeGroot and G. Lindstrom, Eds., Prentice-Hall, 1986, pp. 3-36.Google Scholar
- 27.REDDY, U. S. Functional logic languages, Part I. In Graph Reduction, Springer-Verlag, 1987, pp. 401-425. (Lecture Notes in Computer Science, Vol 279). Google ScholarDigital Library
- 28.REDDY, U. S. Rewriting techniques foT pmgmm synthesis and inductive theorem proving. Preprint, Univ. Illinois at Urbana-Champaign, Nov. 1987.Google Scholar
- 29.REDDY, U. S. Program transformation without folding. Preprint, Univ. iliinois at Urbana-Champaign, Jan. 1988.Google Scholar
- 30.REDDY, U. S. Applicative Techniques for Imperative Programs. Draft, Univ. Ilhnois at Urbana-Champaign, July 1988.Google Scholar
- 31.REDDY, U. S. Design principles for an interactive program derivation system. In Proc. AAAI-88 Workshop on Automating Software Design (1988), AAAI. (to appear).Google Scholar
- 32.RICH, C., AND WATERS, R. C. Artificial Intelligence and Software Engineering. Morgan Kaufman+ 1986. Google ScholarDigital Library
- 33.ROBINSON, J. A. A machine-oriented logic based on the resolution principle. J. ACM li? (1965), 23-41. Google ScholarDigital Library
- 34.SCHERLIS, W. L. Programimprovement by internal specialization. In ACM Symp. on Print. of Program. Lang. (1981), ACM, pp. 41-49. Google ScholarDigital Library
- 35.TAMAKI, H., AND SATO, T. Unfold/fold transformation of logic programs. ln Intern. Conf. on Logic Program. (Uppda, 1984), pp. 127-138.Google Scholar
- 36.TEITELBAUM, T., AND REPS, T. The Cornell program synthesizer: A syntax-directed programming environment. Commun. ACM 24, 9 (Sept 1981), 563-573. Google ScholarDigital Library
- 37.TURCHIN, V. F. The concept of a supercompiier. ACM Trans. Program. Lang, Syst. 8, 3 (1986), 292-325. Google ScholarDigital Library
- 38.TURNER, D. Miranda: a non-strict functional language with polymorphic types. In Conf. on Functional Program. Lang. and Comput. Architecture (1985), J. Jouannaud, Ed., Springer-Verlag, pp. 1-16. Google ScholarDigital Library
- 39.WATERS, R. The programmer's apprentice: A session with KBEmacs. IEEE TTans. Softw. Eng. SE-II, 11 (Nov. 1985), 1296-1320. Google ScholarDigital Library
- 40.WILE, D. S. Program developments: Formal explanations of implementations. Comm. ACM 26, 11 (1983), 902-911. Google ScholarDigital Library
Index Terms
- Transformational derivation of programs using the focus system
Recommendations
A transformational approach to the derivation of hardware algorithms from recurrence equations
Supercomputing '88: Proceedings of the 1988 ACM/IEEE conference on SupercomputingHardware algorithms have a significant impact on the supercomputing of matrix computation and signal processing. In this paper, we propose a new approach to the derivation of hardware algorithms from recurrence equations, which is based on program ...
A Transformational Derivation of a Parsing Algorithm in a High-Level Language
This paper presents a detailed algorithm derivation scenario, using correctness preserving source-to-source transfonnations. The algorithm derived is the Cocke-Younger nodal spans parsing algorithm. We describe a high-level SETL-like specification ...
Transformational derivation of programs using the focus system
Special issue: Proceedings of the ACM SIGSOFT/SIGPLAN software engineering symposium on practical software development environments
Comments