- Aho, A. V., Hopcroft, J. E., and Ullman, J. D. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974. Google ScholarDigital Library
- Aho, A. V., and Ullman, J. D. The Theory of Parsing, Translation, and Compiling, Vol. 1: Parsing. Prentice-Hall, Englewood Cliffs, N. ew Jersey, 1972.Google ScholarDigital Library
- Balzer, R. Imprecise program specification. Report ISI/RR-75-36, Inform. Sciences Inst., Dec. 1975.Google Scholar
- Conway, M. E. Design of a separable transition-diagram compiler. Comm. ACM 6, 7 {July 1963), 396--408. Google ScholarDigital Library
- Davis, R. Interactive transfer of expertise: Acquisition of new inference rules. Proc. Int. Joint Conf. on Artif. Intell. MIT, Cambridge, Mass., August 1977, pp. 321--328.Google Scholar
- Dijkstra, E. W. Notes on structured programming. In Structured Programming, O. J. Dahl, E. W. Dijkstra, and C. A. R. Hoare, Academic Press, New York, 1972, pp. 1--82. Google ScholarDigital Library
- Donzeau-Gouge, V., Huet, G., Kahn, G., Lang, B., and Levy, J. J. A structure oriented program editor: A first step towards computer assisted programming. Res. Rep. 114, IRIA, Paris, April 1975.Google Scholar
- Floyd, R. W. The syntax of programming languages--A survey. IEEE EC-13, 4 (Aug. 1964), 346--353.Google Scholar
- Floyd, R. W. Nondeterministic algorithms. J. ACM 14, 4 (Oct. 1967), 636--644. Google ScholarDigital Library
- Gelernter. Realization of a geometry-theorem proving machine. In Computers and Thought, E. Feigenbaum and J. Feldman, Eds., McGraw-Hill, New York, 1963, pp. 134--152. Google ScholarDigital Library
- Green, C. C., and Barstow, D. On program synthesis knowledge. Artif Inte11. 10, 3 (June 1978), 241--279.Google Scholar
- Hewitt, C. PLANNER: A language for proving theorems in robots. Proc. Int. Joint Conf. on Artif. Intell., Washington, D.C., 1969.Google Scholar
- Hewitt, C. Description and theoretical analysis (using schemata) of PLANNER.. AI TR-258, MIT, Cambridge, Mass., April 1972.Google Scholar
- Hoare, C. A. R. Communicating sequential processes. Comm. ACM 21, 8 (Aug. 1978), 666-677. Google ScholarDigital Library
- Jensen, K., and Wirth, N. Pascal User Manual and Report. Springer-Verlag, New York, 1978. Google ScholarDigital Library
- Kuhn, T. S. The Structure of Scientific Revolutions. Univ. of Chicago Press, Chicago, Ill., 1970.Google Scholar
- Lawler, E., and Wood, D. Branch and bound methods: A survey. Operations Res. 14, 4 (July-Aug. 1966), 699--719.Google Scholar
- MACLISP Manual. MIT, Cambridge, Mass., July 1978.Google Scholar
- Minsky, M. Form and content in computer science. Comm. ACM 17, 2 (April 1970), 197--215. Google ScholarDigital Library
- Nilsson, N. J. Problem Solving Methods in Artificial Intelligence. McGraw-Hill, New York, 1971. Google ScholarDigital Library
- Parnas, D, On the criteria for decomposing systems into modules. Comm. ACM 15, 12 (Dec. 1972), 1053--1058. Google ScholarDigital Library
- Rich, C., and Shrobe, H. Initial Report on a LISP programmer's apprentice. IEEE J. Software Eng. SE-4, 6 (Nov. 1978), 456--467. Google ScholarDigital Library
- Rulifson, J. F., Derkson, J. A., and Waldinger, R. J. QA4: A procedural calculus for intuitive reasoning. Tech. Note 73, Stanford Res. Inst., Menlo Park, Calif., Nov. 1972.Google Scholar
- Shortliffe, E. H. Computer-Based Medical Consultations: MYCIN. American Elsevier, New York, 1976.Google Scholar
- Sussman, G. J., Winograd, T., and Charniak, C. MICROPLANNER reference manual. AI Memo 203A, MIT, Cambridge, Mass., 1972.Google Scholar
- Teitelman, W., et al. INTERLISP manual. Xerox Palo Alto Res. Ctr., 1974. Google ScholarDigital Library
- Wirth, N. Program development by stepwise refinement. Comm. ACM 14 (April 1971), 221--227. Google ScholarDigital Library
- Wirth, N. The programming language Pascal. Acta Informatica 1, 1 (1971), 35--63.Google ScholarDigital Library
- Wirth, N. Systematic Programming, an Introduction. Prentice-Hall, Englewood Cliffs, New Jersey, 1973. Google ScholarDigital Library
Index Terms
- The paradigms of programming
Recommendations
Amalgamating multiple programming paradigms in Prolog
IJCAI'87: Proceedings of the 10th international joint conference on Artificial intelligence - Volume 1This paper discusses the issues in amalgamating multiple programming paradigms in the logic programming language, Prolog. It is shown that multiple paradigms can be incorporated without disturbing logic programming language features and efficiency. It ...
Comments