Agha G, (1986). Actors: a model of concurrent computation in distributed systemsMIT Press.

Barr A and Feigenbaum E A, (1982). The Handbook of Artificial Intelligence 2Pitman.

Brinch Hansen P, (1973). Operating System PrinciplesPrentice Hall.

Chang C L, (1970). “The unit proof and input proof in theorem proving” JACM17698–707.

Codognet C, Codognet P and File G, (1988). “Yet another intelligent backtracking method” Proc. Fifth Int. Conf. and Symp. on Logic ProgrammingKowalski R and Bowen K (Eds.) MIT Press.

Colmerauer A, (1973), “Les systems-Q ou un formalisme pour analyser et synthetiser des phrases sur ordinateur” Publication Interne No 43, Department d'Informatique, Universite de Montreal.

Colmerauer A, (1982). “Prolog and infinite trees” In: Logic ProgrammingClark KL and Tarnlund SA, Academic Press.

Devlin K, (1987). “A clever little number” The Guardian July 16th.

Dowson M, (1984). “A note on Micro-Planner” In: Implementations of PrologCampbell J A (Ed.) Ellis Horwood.

Elcock E W, (1988). “Absys: the first logic programming language—a retrospective and commentary” to be published Jnl Logic Programming.

Gardner M, (1982). Logic Machines and DiagramsHarvester Press.

Goldberg A and Robson D, (1983). Smalltalk-80: The Language and its Implementation, Addison-Wesley.

Green C, (1969). The Application of Theorem Proving to Question-Answering Systems PhD thesis, Stanford.

Harel A and Pnueli A, (1985). “On the Development of Reactive Systems” In: Logics and models of Concurrent SystemsApt K R (Ed.), Springer Verlag.

Herbrand J, (1930). “Reserche sur la theorie de la demonstration” These, U. de Paris. In: Escrit logiques de Jocoques Herbrand PUF, Paris (1969).

Hewitt C, (1969). “Planner: a language for proving theorems in robots” Proc IJCAI 1 295–301.

Hewitt C, (1985). “The challenge of Open Systems” BYTE04 1985, 223–42.

Hoare C A R, (1982). “Specifications, programs and implementations” Oxford University Tech Monograph PRG-29, Oxford.

Hoare C A R, (1985). Communicating Sequential ProcessesPrentice Hall.

Inmos Ltd, (1984). Occam Programming ManualPrentice Hall.

Jaffar J and Lassez J-L, (1987). “Constraint logic programming” Proc 14th ACM POPL Conference, Munich.

Kuehner D, (1972). “Some special purpose resolution systems Machine Intelligence7117–128, Edinburgh University Press.

Lighthill J, (1972). Artificial Intelligence Reports to SERC, HMSO.

Loveland D W, (1969). “A simplified format for the model elimination theorem-proving procedure” JACM16349–63.

Loveland D W, (1970). “A linear format for resolution” Proc of the INRIA Symposium on Automatic Demonstration 1968 147–162, Roquenfort, Springer-Verlag.

McCarthy J, (1958). “Programs with common sense” Proceedings on the Symposium on the Mechanization of Thought Processes National Physics Lab, Teddington, England.

McCarthy J, (1978). History of LISP, ACM SIG PLAN Notices 13 (8) 5, 11.

Milner R, (1980). A Calculus of Communicating Systems LNCS 92, Springer Verlag.

Newell A. “Duncker on thinking: an enquiry into progress in cognition” Carnegie-Mellon University, Technical Report CS-80–151.

Newell A, Shaw J C and Simon H A, (1956). “The logic theory machine: a complex information processing system” IRE Trans on Information Theory261–79.

New Generation Computing, (1988). Selected Papers from the Workshop on Partial Evaluation and Mixed Computation 6 (2,3).

Ringwood G A, (1987). “Pattern-directed, Markovian, linear guarded, definite clause resolution, submitted JLP but rejected after the unreasonably long time of 21 months.

Ringwood G A, (1988a). “Parlog 86 and the dining logicians” CACM3110–25.

Ringwood G A, (1988b). “SLD: a folk acronym?” Logic Programming Newsletter2/15–8.

Ringwood G A, (1988c). “A comparative exploration of concurrent logic languages” submitted The Knowledge Engineering Review.

Ringwood G A, (1989). “SLD: a folk acronym?” To be published SIGPLAN Notices.

Robinson J A, (1965). “A machine-oriented logic based on the resolution principle” JACM1223–41.

Schofield J, (1988). “The taxonomy of computer evolution” The Guardian 29 12 1.

Sussmann G J and McDermott D V, (1972). “From planner to conniver—a genetic approach” Proc AFIPS Fall Conference1171–1179.

Ungar D and Patterson D, (1987). “What price Smalltalk” IEEE Computer2067–72.

Warren D H D, (1987). “OR-parallel execution models of Prolog” In: Tapsoft 87, LNCS 250, Springer-Verlag.