Ralph E. Griswold
David R. Hanson
John T. Korb
- 1 BIRTWISTLE, G.M., DAHL, O.-J., MYHRHAUG, B., AND NYGAARD, K. SIMULA Begin (Student Literature). Auerbach, Philadelphia, 1973. Google Scholar
- 2 BOBROW, D.G., AND RAPHAEL, B. New programming languages for artificial intelligence research. Comput. Surv. (ACM) 6, 3 (Sept. 1974), 153-174. Google Scholar
- 3 BOBROW, D.G.,ANDWEG~REIT, B. Amodelandstackimplementationofmultipleenvironments. Commun. ACM 16, 10 (Oct. 1973), 591-603. Google Scholar
- 4 BOWEN, K.A. PROLOG. In Proc. 1979Ann Conf. (Detroit, Mich., Oct. 29-31, 1979), ACM, New York, pp. 14-23. Google Scholar
- 5 DAHL, O.-J., DIJKSTRA, E.W., AND HOARE, C.A.R. Structured Programming. Academic Press, London, 1972, pp. 72-82. Google Scholar
- 6 FLOYD, R.W. Nondeterministic algorithms. J. ACM 14, 4 (Oct. 1967), 636-644. Google Scholar
- 7 FRIEDMAN, D.P., AND WISE, D.S. CONS should not evaluate its arguments. In Automata, Languages, and Programming, S. Michaelson and R. Milner, Eds., Edinburgh Univ. Press, Edinburgh, 1976, pp. 257-284.Google Scholar
- 8 GIMPEL, J.F. Algorithms in SNOBOL4. Wiley, New York, 1976. Google Scholar
- 9 GOLOMB, S.W., AND BAUMERT, L.D. Backtrack programming. J. ACM 12, 4 (Oct. 1965), 516- 524. Google Scholar
- 10 GRISWOLD R.E. The Icon programming language: A new approach to high-level string processing. In Proc. 1979Ann. Conf. (Detroit, Mich., Oct. 29-31, 1979), ACM, New York, pp. 8-13. Google Scholar
- 11 GRISWOLD R.E. The SL5 programming language and its use for goal-directed programming. In Proe. 5th Texas Conf. on Computer Systems, Univ. Texas, Austin, Oct. 1976.Google Scholar
- 12 GRISWOLD R.E., AND HANSON, D.R. An alternative to the use of patterns in string processing. ACM Trans. Program. Lang. Syst. 2, 2 (April 1980), 153-172. Google Scholar
- 13 GRISWOLD R.E., AND HANSON, D.R. Reference manual for the Icon programming language. Tech. Rep. TR 79-1a, Dep. Computer Science, Univ. Arizona, Tucson, Feb. 1980.Google Scholar
- 14 GRISWOLD R.E., AND HANSON, D.R. An overview of SL5. SIGPLAN Notices (ACM) 12, 4 (April 1977), 40-50. Google Scholar
- 15 GRISWOLD R.E., HANSON, D.R., AND KORB, J.T. The Icon programming language: An overview. SIGPLAN Notices (ACM) 14, 4 (April 1979), 18-31. Google Scholar
- 16 GRISWOLD R.E., POAGE, J.F., AND POLONSKY, I.P. The SNOBOL4 Programming Language, 2d ed. Prentice-Hall, Englewood Cliffs, N.J., 1971. Google Scholar
- 17 GUIBAS, L.J., AND WYATT, D.K. Compilation and delayed evaluation in APL. In Conf. Rec., 5th Ann. ACM Syrup. on Principles of Programming Languages, Tucson, Ariz., Jan. 23-25, 1978, pp. 1-8. Google Scholar
- 18 HANSON, D.R. Procedure-based linguistic mechanisms in programming languages. Ph.D. disserration, Dep. Computer Science, Univ. Arizona, Tucson, 1976. Google Scholar
- 19 HANSON, D.R. A procedure mechanism for backtrack programming. In ACM '76: Proc. Ann. Conf., Houston, Tex., Oct. 20-22, 1976, pp. 401-405. Google Scholar
- 20 HANSON, D.R., AND GRISWOLD, R.E. The SL5 procedure mechanism. Commun. ACM 21, 5 (May 1978), 392-400. Google Scholar
- 21 HANSON, D.R., AND HANSEN, W.J. Icon implementation notes. Tech. Rep. TR79-12a, Dep. Computer Science, Univ. Arizona, Feb. 1980.Google Scholar
- 22 HENDERSON, P., AND MORRIS, J.H. JR. A lazy evaluator. In Conf. Rec., 3d ACM Symp. on Principles of Programming Languages, Atlanta, Ga., Jan. 19-21, 1976, pp. 95-103. Google Scholar
- 23 H~,WlTT, C. PLANNER: A language for manipulating models and proving theorems in a robot. In Proc. 2d Int'l Joint Conf. on Artificial Intelligence, London, 1971, pp. 167-182.Google Scholar
- 24 KAHN, G., AND McQUEEN, D.B. Coroutines and networks of parallel processes. In Proc. IFIPS 77, 1977, pp. 993-998.Google Scholar
- 25 KLINT, P. An overview of the SUMMER programming language. In Conf. Rec., 7th Ann. ACM Symp. on Principles of Programming Languages, Las Vegas, Nev., Jan. 28-30, 1980, pp. 47-55. Google Scholar
- 26 KORB, J.T. The design and implementation of a goal-directed programming language. Ph.D. dissertation, Univ. Arizona, Tucson, 1979. Google Scholar
- 27 LINDSTROM, G. Backtracking in a generalized control setting. ACM Trans. Program. Lang. Syst. 1, 1 (July 1979), 8-26. Google Scholar
- 28 LISKOV, B., SNYDER, A., ATKINSON, R., AND SCHAFFERT, C. Abstraction mechanisms in CLU. Commun. ACM 20, 8 (Aug. 1977), 564-576. Google Scholar
- 29 MCCARTHY, J., ABRAHAMS, P., EDWARDS, D., HART, T., AND LEVIN, M. LISP 1.5 Programmer's Manual, 2d ed. MIT Press, Cambridge, Mass., Feb. 1965. Google Scholar
- 30 McDERMOTT, D.V., AND SUSSMAN, G.J. The CONNIVER reference manual. AI Lab. Memo 259, MIT, Cambridge, Mass., 1972.Google Scholar
- 31 NEWELL, A. (ED.) Information Processing Language- V Manual, Rand Corp., Prentice-Hall, Englewood Cliffs, N.J., 1961.Google Scholar
- 32 PRENNER, C.J., SPITZEN, J.M., AND WEGBREIT, B. An implementation of backtracking for programming languages. SIGPLAN Notices (ACM) 7 (Nov. 1972), 36-44. Google Scholar
- 33 REISER, J.F. SAIL. Tech. Rep., Stanford AI Lab., Computer Science Dep., Aug. 1976. Google Scholar
- 34 RITCHIE, D.M., AND THOMPSON, K. The UNIX timesharing system. Commun. ACM 17, 16 (July 1974), 365-375. Google Scholar
- 35 SHAW, M., WULF, W.A., AND LONDON, R.L. Abstraction and verification in Alphard: Defining and specifying iteration and generators. Commun. ACM 20, 8 (Aug. 1977), 553-564. Google Scholar
- 36 SMITH, D.C., AND ENEA, H.J. Backtracking in MLISP2. In Proc. 3d Int'l Joint Conf. on AI, Stanford, Calif., 1973, pp. 677-685.Google Scholar
- 37 SUSSMAN, G.J., AND MCDERMOTT, D.V. From PLANNER to CONNIVER--A genetic approach. In Proc. AFIPS 1972 Fall Joint Computer Conf., vol. 41, AFIPS Press, Arlington, Va., 1972, pp. 1171-1179.Google Scholar
- 38 VAN WIJNGAARDEN, A., MAILLOUX, B.J., PECK, J.E.L., KOST}~R, C.H.A., SINTZOFF, M., LINDSEY, C.H., MEERTENS, L.G.L.T., AND FISKER, R.G. (Eds.). Revised report on the algorithmic language Algol 68. Acta Inf. 5 (Jan. 1976), 1-236.Google Scholar
- 39 WARREN, D.H.D., PEREIRA, L.M., AND PEREIRA, F. PROLOG--The language and its implementation compared with LISP. In Proc. Symp. on Artificial Intelligence and Programming Languages, Rochester, N.Y., Aug. 1977, pp. 109-115. Google Scholar
- 40 WETHERELL, C. Etudes for Programmers. Prentice-Hall, Englewood Cliffs, N.J., 1978. Google Scholar
- 41 WroTH, N. Algorithms + Data Structures = Programs. Prentice-Hall, Englewood Cliffs, N.J., 1976.Google Scholar
- 42 WroTH, N. The programming language Pascal. Acta Inf. I (Jan. 1971), 35-63.Google Scholar
- 43 WULF, W.A., LONDON, R.L., ANO SHAW, M. An introduction to the construction and verification of Alphard programs. IEEE Trans. Softw. Eng. SE-2, 4 (Dec. 1976), 253-265.Google Scholar
Index Terms
- Generators in Icon
Recommendations
Bit-Wise Behavior of Random Number Generators
In 1985, G. Marsaglia proposed the m-tuple test, a runs test on bits, as a test of nonrandomness of a sequence of pseudorandom integers. We try this test on the outputs from a large set of pseudorandom number generators and discuss the behavior of the ...
Paradigms for Unconditional Pseudorandom Generators
This is a survey of unconditional pseudorandom generators (PRGs). A PRG uses a short, truly random seed to generate a long, "pseudorandom" sequence of bits. To be more specific, for each restricted model of computation (e.g., bounded-depth circuits or ...
Comments