\begin{enumerate}
\item
Aho, A.V. and Ullman, J.D., 1977,
{\em Principles Of Compiler Design},
Addison-Wesley.
\item
Ait-Kaci, H. and Podelski, A., 1991,
"Towards a Meaning of LIFE",
in Maluszinski, J. and Wirsing, M., (eds), 1991,
{\em Programming Language Implementation and Logic Programming},
Springer, Lecture Notes in Computer Science,
Vol. 528, pp 255 - 274.
\item
Allison, L., 1986,
{\em A practical introduction to denotational semantics},
Cambridge University Press.
\item
Anderson, A. R., and Belnap, N. D., 1975,
{\em ENTAILMENT the Logic of Relevance and Necessity},
Princeton University Press.
\item
Asperti, A. and Longo, G., 1990,
{\em Categories, Types and Structures}, An introduction
to category theory for the working computer scientist,
M.I.T. Press.
\item
Backus, J., 1981,
"Is Computer Science based on the wrong fundamental
Concept of Program? An extended Concept",
in de Backer and van Vliet, (eds), 1981,
{\em Algorithmic Languages},
IFIP, North Holland, pp 133 - 165.
\item
Barrett, R., Ramsay, A. and Sloman, A., 1986,
{\em POP-11 A practical language for Artificial Intelligence},
Ellis Horwood - John Wiley.
\item
Bennett, J.P., 1990,
{\em Introduction to Compiling Techniques,
A First Course using ANSI C, LEX and YACC},
McGraw-Hill.
\item
Berry, R.E., 1982,
{\em Programming Language Translation},
Ellis Horwood.
\item
Best, E., 1986,
"COSY: Its Relation to Nets and to CSP",
in Brauer, W., Reisig, W. and Rozenberg, G., (eds), 1986,
{\em Petri Nets: Applications and Relationships
to other Models of Concurrency},
Springer, Lecture Notes in Computer Science,
Vol. 255, pp 416 - 440.
\item
Billington, J., Wheeler, G.R. and Wilbur-Ham, M.C., 1988,
"PROTEAN: A High-Level Petri Net Tool for the
Specification and Verification of Communication Protocols",
{\em IEEE Transactions on Software Engineering},
Vol. 13, 3, pp 301 - 316.
\item
Bird, R. and Wadler, P., 1988,
{\em Introduction to Functional Programming},
Prentice Hall.
\item
Blaesius, K.H. and Buekert, H.-J., (eds), 1989,
{\em Deduction Systems in Artificial Intelligence},
Ellis Horwood.
\item
Bolognesi, T. and Brinksma, E., 1987,
"Introduction to the ISO Specification Language LOTOS",
{\em Computer Networks and ISDN Systems},
Vol. 14, pp 25 - 59;
also in van Eijk, P.H.J., Vissers, C.A. and Diaz, M., 1989,
{\em The Formal Description Technique LOTOS},
North Holland.
\item
Brinch Hansen, P., 1985,
{\em Brinch Hansen On Pascal Compilers},
Prentice Hall.
\item
Brownston, L., Farrell, R., Kant, E. and Martin, N., 1985,
{\em Programming Expert Systems in OPS5 -
An Introduction to Rule-Based Programming},
Addison-Wesley.
\item
Buekert, H.-J., 1989,
"Computational Logic",
in Blaesius and Buekert (1989, pp 177 - 202).
\item
Bueckert, H.-J., 1990,
"A Resolution Principle for Clauses with Constraints",
in Stickesl, M.E., (ed), 1990,
{\em 10th International Conference on Automated Deduction},
Springer, Lecture Notes in Computer Science, Vol. 449,
pp 178 - 192.
\item
Burton, M. and Shadbolt, N., 1987,
{\em POP-11 Programming for Artificial Intelligence},
Addison Wesley.
\item
Calingaert, P., 1979,
{\em Assemblers, Compilers and Program Translation},
Computer Science Press.
\item
Campbell, J.A., 1984,
{\em Implementations of PROLOG},
Ellis Horwood.
\item
Campbell, P.E. and Habermann, A.N., 1974,
"The Specification of
Process Synchronisation by Path Expressions",
Springer, Lecture Notes in Computer Science,
Vol. 16, pp 89-102.
\item
Capon, P.C. and Jinks, P.J., 1988,
{\em Compiler Engineering Using Pascal},
MacMillan.
\item
Carlier, J., Chretienne, Ph., and Girault, C., 1984,
"Modelling scheduling problems with timed Petri nets",
in Rozenberg (1984), pp 62 - 82.
\item
Chapman, N.P., 1987,
{\em LR Parsing - Theory and Practice},
Cambridge University Press.
\item
Clocksin, W.F. and Mellish., C.S., 1981,
{\em Programming in Prolog},
Springer.
\item
Cohen, M.R. and Nagel, E., 1934,
{\em An Introduction to LOGIC AND SCIENTIFIC METHOD},
Routledge and Kegan Paul.
\item
Collins, W.J., 1986,
{\em Intermediate Pascal Programming, A Case Study Approach},
McGraw-Hill.
\item
Colmerauer, A., 1982,
"An Interesting Subset of Natural Language",
in Clark, K.L. and Tarnlund, S.A., (eds), 1982,
{\em Logic Programming},
Academic Press, pp 45 - 66.
\item
Comer, D., 1979,
"MAP: A Pascal Macro Preprocessor for
Large Program Development",
{\em Software - Practice And Experience}, Vol. 9, pp 203 - 209.
\item
Comer, D., 1980,
"Program MAP, portable version"
{\em PASCAL NEWS}, Nr 17, pp 29 - 40.
\item
Coopers, D. and Clancy, M., 1985,
{\em Oh! Pascal!},
Norton.
\item
Cousineau, G., Curien, P.L. and Mauny, M., 1987,
"The Categorical Abstract Machine",
Science of Programming, Vol. 8., pp ? - ?.
\item
Curien, P.,
{\em Categorial Combinators, Sequential Algorithms
and Functional Programming},
London: Pitman.
\item
de Bakker, J.W., de Roever, W.P. and Rozenberg, G., (eds), 1989,
{\em Linear Time, Branching Time and Partial Order
in Logics and Models of Concurrency},
Springer, Lecture Notes in Computer Science, Vol. 354.
\item
Dunn, M.J., 1976,
"Intuitive Semantics for First-Degree Entailments
and 'Coupled Trees'",
{\em Philosphical Studies}, Vol. 29, pp 149 - 167.
\item
Eisinger, N. and Ohlbach, H.J., 1989,
"The Foundations",
in Blaesius and Buekert (1989, pp 37 - 113).
\item
Emerson, E.A. and Srinivasan, J., 1989,
"Branching Time and Temporal Logic",
in De Bakker, De Roever and Rozenberg (1989), pp 123 - 172.
\item
Engelfriet, J., 1974,
{\em Simple Program Schemes and Formal Languages},
Springer, Lecture Notes in Computer Science, Vol. 20.
\item
Farmer, M., 1985,
{\em Compiler Physiology for Beginners},
Lund, Sweden: Chartwell-Bratt Studentliteratur.
\item
Farreny, H., 1988,
{\em AI AND EXPERTISE:
Heuristic Search, Inference Engines, Automatic Proving},
Ellis Horwood.
\item
Field, A.J. and Harrison, P.E., 1988,
{\em Functional Programming},
Addison Wesley.
\item
Filman, R.E. and Friedman, D.P., 1984,
{\em Coordinated Computing},
McGraw-Hill.
\item
Fokkinga, M.M., 1987,
"Correctness proof of sorting by means of formal procedures",
{\em Science of Computer Programming}, Vol. 9, pp 263 - 269.
\item
Galton, A., (ed), 1987,
{\em Temporal Logics and their applications},
Academic Press.
\item
Glaser, H., Hankin, C. and Till, D., 1984,
{\em Principles of Functional Programming}:
Prentice Hall.
\item
Griswold, R.E., 1972,
{\em The Macro Implementation of SNOBOL4},
Freeman and Co.
\item
Griswold, R.E. and Griswold, M.T., 1986,
{\em The Implementation of the Icon Programming Language},
Princeton University Press.
\item
Griswold, R.E. and Hanson, D.R., 1979,
{\em Reference Manual for the Icon Programming Language},
Dept. of Computer Science, The University of Arizona.
\item
Griswold, R.E., Poage, J.F. and Polonsky, I.P., 1971,
{\em The SNOBOL4 Programming Language},
Prentice Hall.
\item
Grune, D, and Jacobs, C.J.H, 1990,
{\em Parsing Techniques - a Practical Guide},
Ellis Horwood.
\item
Gustason, W. and Ulrich, D.E., 1973,
{\em Elementary Symbolic Logic},
Holt, Rinehart and Winston.
\item
Halpin, T.A. and Girle, R.A., 1981,
{\em Deductive Logic},
Logiqpress, Brisbane, Queensland, Australia.
\item
Harland, D.M., 1984,
{\em Polymorphic Programming Languages -
Design and Implementation},
Ellis Horwood, John Wiley.
\item
Henderson, P., 1980,
{\em Functional Programming - Application and Implementation},
Prentice Hall.
\item
Henson, M.C., 1987,
{\em Elements of Functional Languages},
Blackwell Scientific Publications.
\item
Hoare, C.A.R, 1985,
{\em Communicating Sequential Processes},
Prentice Hall.
\item
Hoare, C.A.R. and Shepherdson, J.C., (eds), 1985,
{\em Mathematical Logic and Programming Languages},
Prentice Hall.
\item
Holzmann, G.J., 1991,
{\em Design and Validation of Computer Protocols},
Prentice Hall.
\item
Hopcroft, J. and Ullmann, J., 1979,
{\em Introduction to Automata Theory, Languages and Computation},
Addison Wesley.
\item
Hughes, G.E. and Cresswell, M.J., 1972,
{\em An Introduction to Modal Logic},
Methuen.
\item
Hughes, G.E. and Londey, D.G., 1965,
{\em The Elements of Formal Logic},
Methuen.
\item
ISO International Standards Association, 1987,
"LOTOS - A Formal Description Technique Based on
the Temporal Ordering of Observational Behaviour",
ISO/TC 97/SC 21.
\item
Jeffrey, R.G., 1967,
{\em Formal Logic, its Scope and Limits},
McGraw Hill.
\item
Jones, N.D., 1990,
"Partial Evaluation, Self-Application and Types",
in Paterson (1990, pp 639 - 659).
\item
Kamin, S.N., 1990,
{\em Programmin Languages, an Interpreter Based Approach},
Addison Wesley.
\item
Kelly, P., 1989,
{\em Functional Programming for Loosely-coupled Multiprocessors},
Pitman, MIT Press.
\item
Kernighan, B.W. and Plauger, P.J., 1981,
{\em Software Tools In Pascal},
Addison Wesley.
\item
Klint, P., 1985,
{\em A Study in String Processing Languages},
Springer, Lecture Notes in Computer Science, Vol. 205.
\item
Kluzniak, F. and Szpakiwicz, S., 1985,
{\em Prolog for Programmers},
Academic Press.
\item
Konikowska, B., Tarlecki, A. and Blikle, A., 1988,
"A three-valued logic for
software specification and validation",
in Bloomfield, R., Marshall, L and Jones, R., (eds), 1988,
{\em VDM 88, VDM - The Way Ahead},
Lecture Notes in Computer Science, Vol. 328,
Springer, pp 218 - 242.
\item
Kuehn, P.J., 1986,
{\em New Communication Services:
A Challenge to Computer Technology},
North-Holland.
\item
Lauer, P.E. and Shields, M.W., 1980,
"COSY - An environment for develpment and analysis
of concurrent and distributed system",
in Huenke, H., (ed),
{\em Software Engineering Environments},
North Holland, pp 119 - 156.
\item
Lecarme, O. and Pellissier Gart, M., 1986,
{\em Software Portability},
McGraw-Hill.
\item
Leestma, S. and Nyhoff, L., 1990,
{\em Pascal, Programming and Problem Solving},
MacMillan.
\item
Lewis, P.M., Rosenkrantz, D.J. and Stearns, R.E., 1976,
{\em Compiler Design Theory},
Addison Wesley.
\item
Li, P., Dillon, T. and von Thun, M., 1988,
"An Investigation of Developing Protocol Implementation
from a Petri Net Description"
Proceedings of the
Third Australian Software Engineering Conference,
Canberra, May 1988, pp 251 - 266.
\item
Lieberman, H., 1987,
"Concurrent Object-Oriented Programming in Act 1"
in Yonezawa, A. and Tokoro, M., (eds), 1987,
{\em Object-Oriented Concurrent Programming},
MIT Press, pp 9 - 36.
\item
Liskov, B., Atkinson, R., Bloom, T., Moss, E.,
Schaffert, J.C., Scheifler, R. and Snyder, A., 1981,
{\em CLU Reference Manual},
Springer, Lecture Notes in Computer Science, Vol. 114.
\item
Loeckx, J., Mehlhorn, K. and Wilhelm, R., 1988,
{\em Foundations of Programming Languages},
John Wiley.
\item
MacLennan, B. J., 1983,
{\em Principles Of Programming Languages},
Holt, Rinehart and Winston.
\item
Maes, P. and Nardi, D., (eds), 1988,
{\em Meta-level Architectures and Reflection},
North Holland.
\item
Maier, D. and Warren, D.S., 1988,
{\em Computing with Logic: Logic Programming with Prolog},
B. Cummings.
\item
Makinson, D.C., 1973,
{\em Topics in MOdern Logic},
Methuen.
\item
Manna, Z. and Pnueli, A., 1989,
"The anchored version of temporal logic",
in de Bakker, de Roever and Rozenberg (1989), pp 201 - 284.
\item
Martin, J. N., 1987,
{\em Elements of Formal Semantics}
An Introduction to Logic for Students of Language,
Academic Press.
\item
McCracken, D.D., 1987,
{\em A Second Course in Computer Science with PASCAL},
John Wiley and Sons.
\item
Meijer, E., Fokkinga, M. and Paterson, R., 1991,
"Functional Programming with Bananas, Lenses,
Envelopes and Barbed Wire",
in Hughes, J., (ed), 1991,
{\em Functional Programming Languages and Computer Architecture},
Springer, Lecture Notes in Computer Science,
Vol. 523, pp 124 - 144.
\item
Mellish, C. and Hardy, S. 1984,
"Integrating Prolog in the Poplog environment",
in Campbell (1984) pp 147-162.
\item
Meyer, B., 1988,
{\em Object Oriented Software Construction},
Prentice Hall.
\item
Naqvi, S. and Tsur, S. 1989,
{\em A Logical Language for Data and Knowledge Bases},
New York: Computer Science Press.
\item
Oehrle, R.T., Bach, E. and Wheeler, D., (eds), 1988,
{\em Categorial Grammars and Natural Language Structures},
Reidel.
\item
Pagnoni, A. and Rosenberg, G., 1983,
{\em Applications and Theory of Petri Nets},
Springer, Informatik Fachberichte, Vol. 66.
\item
Paterson, M.S., (ed), 1990,
{\em Automata, Languages and Programming},
Springer, Lecture Notes in Computer Science, Vol. 443.
\item
Peters, J.F., 1986,
{\em Pascal with Program Design},
Holt, Rinehart and Winston.
\item
Peterson, J.L., 1981,
{\em Petri Net Theory and the Modeling of Systems},
Prentice Hall.
\item
Peyton Jones, S., 1987,
{\em The Implementation of Functional Programming Languages},
Prentice Hall.
\item
Pletat, U., 1991,
"The Knowledge Representation Language L LILOG",
in Herzog, O, and Rollinger, C.-R., (eds), 1991,
{\em Text Understanding in LILOG},
Springer, Lecture Notes in Computer Science,
Vol. 546, pp 357 - 379.
\item
Quine, W.V.O., 1971,
{\em Algebraic Logic and Predicate Functors},
Bobs Merrill.
\item
Ramsay, A. and Barrett, R., 1987,
{\em AI IN PRACTICE: Examples in POP-11},
Ellis Horwood - John Wiley.
\item
Reade, C., 1989,
{\em Elements of Functional Programming},
Addison Wesley.
\item
Rees, M. and Robson, D., 1988,
{\em Practical Compiling with Pascal-S},
Addison Wesley.
\item
Reisig, W., 1982,
{\em Petri Nets - an Introduction},
Springer.
\item
Reeves, S. and Clarke, M., 1990,
{\em Logic for Computer Science},
Addison Wesley.
\item
Richards, T.J., 1978,
{\em The Language of Reason},
Pergamon Press.
\item
Richards, T.J., 1989,
{\em Clausal Form Logic},
Addison Wesley.
\item
Rozenberg, G., 1985,
{\em Advances in Petri Nets},
Springer, Lecture Notes in Computer Science, Vol. 188.
\item
Salomaa, A., 1985,
{\em Computation and Automata},
Encyclopedia of Mathematics and its Applications, Vol. 25,
Cambridge University Press.
\item
Schagrin, M.L., Rapaport, W.J. and Dipert, R.R., 1985,
{\em Logic: A Computer Approach},
McGraw-Hill.
\item
Schreiner, A.T. and Friedman, H.G., 1985,
{\em Introduction to Compiler Construction with UNIX},
Prentice Hall.
\item
Schwartz, J.T., Dewar, R.B.K., Dubinsky, E. and Schonberg, E., 1986,
{\em Programming with Sets, An Introduction to SETL},
Springer.
\item
Setzer, V.W., 1979,
"Non-recursive Top-down Syntax Analysis",
{\em Software: Practice and Experience},
Vol. 9., pp 237 - 245.
\item
Shaw, M., (ed), 1981,
{\em ALPHARD: Form and Content},
Springer.
\item
Sifakis, J., (ed), 1990,
{\em Automatic Verification Methods for Finite State Systems},
Springer, Lecture Notes in Computer Science, Vol. 407.
\item
Smullyan, R.M., 1968,
{\em First-order Logic},
Springer.
\item
Spivey, M., 1996,
{\em An Introduction to Logic programming through Prolog},
Prentice Hall.
\item
Steensgard-Madsen, J., 1981,
"Modular Programming with Pascal",
{\em Software: Practice and Experience},
Vol. 11, pp 1331 - 1337.
\item
Sudkamp, T.A., 1988,
{\em Languages and Machines},
An Introduction to the Theory of Computer Science,
Addison Wesley.
\item
Terry, P.D., 1986,
{\em Programming Language Translation},
A Practical Approach,
Addison Wesley.
\item
The Open University, 1986,
"Compiling, Volumes I, II, III",
{\em M353 Programming and Programming Languages}, Units 13, 14, 15,
The Open University Press.
\item
Tremblay, J.-P. and Bunt, R.B., 1979,
{\em An Introduction To Computer Science,
An Algorithmic Approach},
McGraw-Hill, International Student Edition.
\item
Van Hentenryck, P., 1989,
{\em Constraint Satisfaction in Logic Programming},
MIT Press.
\item
Waite, M.M., 1973,
{\em Implementing Software for Non-numeric Applications},
Prentice Hall.
\item
Wallen, L., 1986,
"Generating Connection Calculi from
Tableau and Sequent Based Proof Systems",
in Cohn, A.G. and Thomas, J.R., (eds),
{\em Artificial Intelligence and its Applications},
John Wiley and Sons, pp 35 - 50.
\item
Wheeler, G., 1985,
"Numerical Petri Nets - A Definition",
Telecom Research Laboratories, Report 7780.
\item
Wheeler, G.R., Batten, T.J., Billington, J.
and Wilbur-Ham, M.C., 1986,
"A Methodology for Protocol Engineering",
in Kuehn (1986), pp 525 - 530.
\item
Wilbur-Ham, M.C., Gilmour, J.A., Billington, J., Gaylard, N., 1985,
Protean User's Manual - Version 4.2,
Telecom Australia Research Laboratories.
\item
Wirth, N., 1976,
{\em Algorithms + Data Structures = Programs},
Prentice Hall.
\item
Wirth, N., 1977,
{\em Compilerbau}, (in German)
Teubner, Stuttgart.
\item
Wong, M.C., 1991,
{\em Applying Intelligent Backtracking
to Reachability Analysis},
Fourth Year Honours Thesis,
Department of Computer Science and Computer Engineeering,
La Trobe University, Melbourne.
\end{enumerate}