| OCR Text |
Show REFERENCES 1. W.B. Ackerman, "Data flow languages," Computer, Vol. 15, No. 2, February 1982, pp. 15-25. 2. R.G. Bandes, "Constraining-u nification and the programming language Unicorn," in Proc. 11th POPL, , Salt Lake City, Utah, 1984. 3. R.G. Bandes, "Constraining-unification and the programming language Unicorn," in Logic programming: ref at ions, functions, and equations, D. DeGroot and G. Lindstrom, eds., Prentice-Hall, New York, 1985. 4. M. Bellia, P. Degano and G. Levi, "The call by name semantics of a clause language with functions," in Logic programming, K.L. Clark and S.-A. Tarnlund, eds., Academic Press, New York, 1982, pp. 281-298. 5. J. Bergstra and J. Klop, "Conditional rewrite rules: confluence and termination," Tech. report IW 198/82, Mathematical Center, 1982. 6. A. Berztiss and S. Thatte, "Specification and implementation of abstract data types," in Advances in computers, Volume 22, Marshall C. Yovits, ed., Academic Press, New York, 1983, pp. 296-350. 7. G. Birkhoff, "On the structure of abstract algebras," Proc. Cambridge Phi I. Soc. 31, 1935, pp. 433-454. 8. A. Borning, "The programming language aspects of ThingLab, a constraint-oriented simulation laboratory," ACM TOPLAS, Vol. 3, No. 4, October 1981, pp. 353-387. 9. K.A. Bowen, "PROLOG," ACM National Conference, 1979, pp. 14-23. 10. D. Brandt, J.A. Darringer and W.H. Joyner, Completeness of conditional reductions, IBM Research Center, Yorktown Heights. 11 . R.M. Burstall and D.T. San nella, HOPE user's manual, Dept. of Computer Science, University of Edinburgh, Edinburgh, Scotland, 1980. 12. C.L. Chang and R.C. Lee, Symbolic logic and mathematical theorem proving, Academic Press, New York, 1973. 13. K.L. Clark and S. Gregory, "A relational language for parallel programming," Proc. Functional Programming and Computer Architecture, ACM, October 1981, pp. 171-179. 14. K. L. Clark and S. Gregory, "Parlog: a parallel logic programming |
