[net.ai] References Part 1

abc@nott-cs.UUCP (Andy Cheese) (04/09/86)

ABDA76a
Abdali S.K.
An Abstraction Algorithm for Combinatory Logic
Journal of Symbolic Logic Vol 41, Number 1, March
1976

ABEL85a *
Abelson H. & Sussman G.J. with Sussman J.
Structure and Interpretation of Computer Programs
MIT Press
1985

ABEL?
Abelson H. & Sussman G.J.
Computation: An Introduction to Engineering Design
Massachusetts Institute of technology, U.S.A.

ABEL?
Abelson H. & Sussman G.J.
Scheme Demonstration Programs for Structure and Interpretation of
Computer Programs
Massachusetts Institute of Technology, U.S.A.

ABRA82a
Abramsky S.
SECD-M - A Virtual Machine for Applicative Multiprogramming
Computer Systems Lab, Queen Mary College, Nov 82

ABRA82b
Abramson H.
Unification-Based Conditional Binding Constructs
TR 82-7, Department of Computer Science,
Univ of British Columbia, Canada
August 1982

ABRA83a
Abramsky S.
On Semantic Foundations For Applicative Multiprogramming
Computer Systems Lab, Queen Mary College, 1983

ABRA83b
Abramson H.
A Prological Definition of HASL a Purely Functional Language With Unification
Based Conditional Binding Expressions
TR 83-8, Department of Computer Science,
Univ of British Columbia, Canada
July 26, 1983

ABRI85a
Abrial J.R.
Programming as a Mathematical Exercise
in HOA85a
1985

ACK79a
Ackerman W.B. & Dennis J.B.
VAL - Preliminary Reference Manual
MIT Laboratory for Computer Science, June 79

AIDA84a
Aida H. & Moto-oka T.
Performance Measurement of Parallel Logic Programming System "Paralog"
Dept. of Electrical Eng., University of Tokyo

ALEX85a *
Alexandridis N.A. & Bilalis N.A. & Tsanakas P.D.
Using Functional Programming For Hierarchical Structures in Image Processing
in Digital Techniques in Simulation, Communication and Control (IMACS)
(ed Tzafestas S.G. )
pp 175-181
North Holland 
1985

ALLI85a *
Allison L.
Programming Denotational Semantics II
Computer Journal, Vol 28, no 5, pp 480-486
1985

AMAM82a
Amamiya M. & Takahashi N. & Naruse T. & Yoshida M.
A Data Flow Processor Array System for Solving Partial Differential Equations
Int. Symp. on Applied Mathematics and Information Science, March 1982

ARBI75a
Arbib M.A. & Manes E.G.
Arrows, Structures and Functors : The Categorical Imperative
Academic Press
1975

ARVI78a
Arvind & Gostelow K.P. & Plouffe W.
An Asynchronous Programming Language and Computing Machine
Dept. of Information and Computer Science, Tech Rep 114A
University of California Irvine, December 1978

ARVI83a
Arvind & Dertouzos M.L. & Iannucci R.A.
A Multiprocessor Emulation Facility
MIT Lab for Computer Science Technical Report 302
October 1983

ARVI84a
Arvind & Brock J.D.
Resource Managers in Functional Programming
Journal of Parallel and Distributed Computing 1, 5-21
1984

ARVI84b
Arvind & Kathail V. & Pingali K.
Sharing of Computation in Functional Language Implementations
Lab for Computer Science Tech Rep ??? (sic), 24 July
1984

ASHC76a *
Ashcroft E.A. & Wadge W.
Lucid - A Formal System For Writing and Proving Programs
SIAM J on Computing Vol 5 no 3, 1976
pp 336-354
1976

ASHC77a
Ashcroft E.A. & Wadge W.W.
LUCID, a Non-Procedural Language with Iteration
CACM Vol 20 No 7  p519-526 July 1977

ASHC82a
Ashcroft E.A. & Wadge W.W.
R for Semantics
ACM TOPLAS Vol 4 No 2 p283-294 April 1982

ASHC83a
Ashcroft E.A.
Proposal for a Demand-Driven Tagged Dataflow Machine
SRI Document Sept 1983

ASH85a
Ashcroft E.A.
Eazyflow Architecture
SRI Technical Report CSL-147, April 1985

ASH85b
Ashcroft E.A.
Ferds--Massive Parallelism in Lucid
Document
1985

ASH85c
Ashcroft E.A. & Wadge W.W.
The Syntax and Semantics of Lucid
SRI Technical Report CSL-147
April 1985

ASO84a
Aso M.
Simulator of XP's
ICOT Research Center, Technical Report TR-041
January 1984

ATKI83a *
Atkinson M.P & Bailey P.J. & Chisholm K.J. & Cockshott P.W. & Morrison R.
"An Approach to Persistent Programming"
The Computer Journal,Vol.26,No.4, pp 360-365
1983

AUGU84a *
Augustsson L.
A Compiler for Lazy ML
Proceedings of 1984 ACM Symposium on LISP and Functional Programming,
Austin, Texas
pp 218-227
August 1984

AZAR85a *
Azari H. & Veler Y.
Functional Language Directed Data Driven machine
Microprocessing and Microprogramming 16, pp 127-132
September/October 1985

BACK74a *
Backus J.
Programming Language Semantics and Closed Applicative Languages
ACM Symposium on Principles of Programming Languages, 1974
pp 71-86
1974

BACK78a *
Backus J.
Can Programming be liberated from the von-Neumann Style?
CACM Vol 21 No 8 p613-641 Aug 1978

BACK79a
Backus J.W.
On Extending The Concept Of Program And Solving Linear Functional Equations
Draft Paper Distributed at Summer Workshop on Programming Methodology,
University of California at Santa Cruz, August 1979

BACK81a
Backus J.W.
The Algebra of Functional Programs: Function Level Reasoning, Linear
Equations, and Extended Definitions
In "Formalization of Programming Concepts", LNCS 107
Springer Verlag
April 1981

BAKE78a
Baker, Henry B., Jr.
List Processing in Real Time on a Serial Computer
CACM 21 no 4, pp 280-294, 1978

BAKE78b
Baker H.G.
Actor Systems for Real Time Computation
MIT Laboratory for Computer Science, MIT/LCS/TR-197, March 1978

BAKK76a *
Bakker J.W. De
Semantics and Termination of Nondeterministic Recursive Programs
Proceedings 3rd International Colloquium on Automata Languages and Programming
pp 435-477
Edinburgh University Press, 1976

BAKK79a *
Bakker J.W. De & Zucker J.I.
Derivatives of Programs
mathematisch centrum iw 116/79
1979

BAKK80a
Bakker J.De
Mathematical Theory of Program Correctness
Prentice Hall International Series in Computer Science, 1980

BARA85a *
Barahona P. & Gurd J.R.
Processor Allocation in a Multi-Ring Dataflow Machine
Dept of Comp Sci, Univ of Manchester, Technical Report UMCS-85-10-3
1985

BARB84a *
Barbuti R. & Bellia M. & Levi G. & Martelli M. 
On the Integration of Logic Programming and Functional Programming
IEEE 1984 International Symposium on Logic Programming, pp 160-167
6 February 1984

BARE81a
Barendregt H.P.
The Lambda Calculus, Its Syntax and Semantics
North Holland 1981

BARR85a *
Barringer H.
Up and Down the Temporal Way
Dept of Comp Sci, Univ of Manchester, Technical Report UMCS-85-9-3
September 4, 1985

BCS86a *
British Computer Society Reading Branch Parallel Processing Seminar,
Proceedings
Tuesday 21st January 1986

BELL80a *
Bellia M & Degano P. & Levi G.
A Functional Plus Predicate Logic Programming Language
Proceedings of the Logic Programming Workshop, 14 July 1980
pp 334-347
1980

BERG79a *
Bergstra J.A. & Tucker J.V.
Algebraic Specifications of Computable and Semi-Computable Data Structures
mathematisch centrum iw 115/79
1979

BERG79b *
Bergstra J.A. & Tiuryn J. & Tucker J.V.
Correctness Theories and Program Equivalence
mathematisch centrum iw 119/79
1979

BERG79c *
Bergstra J.A. & Tucker J.V.
A Characterisation of Computable Data Types By Means of a Finite, Equational
Specification Method
mathematisch centrum iw 124/79
1979

BERG81a *
Bergstra J.A. & Tucker J.V.
Hoare's Logic and Peano's Arithmetic
Mathematisch Centrum iw 160/81
1981

BERK75a *
Berkling K.
Reduction Languages For Reduction Machines
Proc. 2nd Int. Symp. on Comp. Arch., pp 133-140
also available as an extended version as GMD Tech Rep  ISF-76-8
14 September 1976
1975

BERK76a *
Berkling K.J.
A Symmetric Complement To The Lambda Calculus
GMD Tech Rep ISF-76-7
14 September 1976

BERK82a *
Berkling K.J.
A Consistent Extension of the Lambda-Calculus as a Base for Functional
Programming Languages
Information and Control, vol 55, nos 1-3 oct/nov/dec 1982, pp 89-101
Academic Press
1982

BERL84a
Berliner H. & Goetsch G.
A Quantative Study of Search Methods and the Effect of
Constraint Satisfaction
CMU-CS-84-147
Dept of Comp Sci, Carnegie-Mellon Univ.
July 1984

BERN80a *
Bernstein A.J.
Output Guards and Nondeterminism in Communicating Sequential Processes
ACM Transactions on Programming Languages and Systems, Vol 2, No 2,
pp 234 - 238
April 1980

BERR77a *
Berry G. & Levy J-J.
Minimal and Optimal Computations of Recursive Programs
4th ACM Symposium on Principles of Programming Languages
pp 215-226
1977

BERT84a
ed. Bertolazzi P
VLSI: Algorithms and Architectures
North Holland 1984

BETZ85a *
Betz D.
XLISP: An Experimental Object Oriented Language Version 1.4
January 1, 1985

BIC85a *
Bic L.
Processing of Semantic Nets on Dataflow Architectures
Artificial Intelligence 27 
pp 219 - 227
1985

BIRD76a
Bird R.S.
Programs & Machines- An Introduction to the Theory of Computation
Wiley 1976

BIRD83a
Bird R.S.
Some Notational Suggestions for Transformational Programming
Tech Rep no 153, Univ. of Reading, 1983

BIRD84a
Bird R.S.
Using Circular Programs to Eliminate Multiple Traversals of Data
Acta Informatica Vol21 Fasc 3 1984 p239-250

BISH77a
Bishop P.B.
Computer Systems with a Very Large Address Space and Garbage Collection
MIT Laboratory for Computer Science, MIT/LCS/TR-178, May 1977

BOBR80a
Bobrow D.G.
Managing Reentrant Structures Using Reference Counts
ACM Trans. on Programming Languages and Systems, 2, no 3, pp 269-273
1980

BOHM81a *
Bohm A.P.W. & Leeuwen J. Van
A Basis for Dataflow Computing
Dept of Computer Science, Univ of Utrecht, Tech Rep RUU-CS-81-6
1981

BOHM85a *
Bohm A.P.W. & Gurd J.R. & Sargeant J.
Hardware and Software Enhancement of the Manchester Dataflow Machine
Document, Dept of Computer Science, Univ. of Manchester

BORN81a *
Borning A. & Bundy A.
Using Matching in Algebraic Equation Solving
Dept of Comp Sci, Univ of Washington, Technical Report No. 81-05-01
May 1981

BOSS84a *
Bossi A. & Ghezzi C.
Using FP As A Query Language For Relational Data-Bases
Computer Languages, Vol 9, No 1, pp 25-37
1984

BOWE79a *
Bowen K.A.
Prolog
Proceedings of the Annual Conference of the ACM 1979
pp 14-23
1979

BOW81a
Bowen D.L.
Implementation of Data Structures on a Data Flow Computer
PhD Thesis, Dept of Comp Sci, Univ. of Manchester, April 1981

BOWE85a
Bowen K.A.
Meta-Level Programming and Knowledge Representation
New Generation Computing, Vol 3, No 4, pp 359-383
1985

BOYE75a
Boyer R.S. & Moore J.S.
Proving Theorems about LISP Functions
JACM Vol 22,No. 1, p129-144

BRAI83
Brain S.
The Transputer-"exploiting the opportunity of VLSI"
Electronic Product Design, December 1983

BRAI84a
Brain S.
Applying the Transputer
Electronic Product Design, January 1984

BRAI84b
Brain S.
Writing Parallel Programs in OCCAM
Electronic Product Design, Sept 1984

BRAM84a *
Bramer M. & Bramer D.
The Fifth Generation, An Annotated Bibliography
Addison-Wesley Publishing Co., 1984

BROO84a
Brookes S.D.
Reasoning About Synchronous Systems
CMU-CS-84-145
Dept of Comp Sci, Carnegie-Mellon Univ.
March 1984

BROW84a
Brownbridge D.
Recursive Structures in Computer Systems
PhD Thesis, Univ. of Newcastle upon Tyne, 1984

BROY82a
eds Broy M. & Schmidt G.
Proceedings of Nato Summer School on Theoretical Foundations of
Programming Methodology, Munich, 
Dordrecht: Reidel, 1982

BROY82b
Broy M.
A Fixed Point Approach to Applicative Multiprogramming
in BROY82a, pp 565-624
1982

BROY83a
Broy M.
Applicative Real-Time Programming
Proc. 9th IFIP, Information Processing 1983, pp 259-264
North Holland 1983

BROY85a *
Broy M.
On The Herbrand-Kleene Universe For Nondeterministic Computations
Theoretical Computer Science, 36, pp 1 - 19
March 1985

BRUI81a *
Bruin A. De
On the Existence of Cook Semantics
Mathematisch Centrum iw 163/81
1981

BRUI85a *
Bruin A. De & Bohm W.
The Denotational Semantics of Dynamic Networks of Processes
ACM Transactions on Programming Languages and Systems, Vol 7, No 4,
pp 656-679
October 1985

BRUY83a *
Bruynooghe M. & Pereira L.M.
Deduction revision by Intelligent Backtracking
Universidade Nova de Lisboa, report no UNL-10/83
July 1983

BRYA85a *
Bryant R.E.
Symbolic Verification of MOS Circuits
1985 Chapel Hill Conference on VLSI
pp 419-438
1985

BUND85a *
Bunder M.W.
An Exension of Klop's Counterexample to the Church-Rosser Property to
Lambda-Calculus With Other Ordered Pair Combinators
Theoretical Computer Science 39, pp 337-342
North Holland
August 1983

BUNE82a
Buneman P. Frankel R.E. & Nikhil R.
An Implementation Technique for Database Query Languages
ACM TODS Vol 7 No. 2 p164-186 June 1982

BURG75a
Recursive Programming Techniques
Addison Wesley Publising Co., 1975

BURN85a *
Burn G.L. & Hankin C.L. & Abramsky S.
The Theory and Practise of Strictness Analysis for Higher Order Functions
Research Report DoC 85/6
Dept of Computing, Imperial College
April 1985

BURS69a
Burstall R.M.
Proving Properties of Programs by Structural Induction
Computer Journal 12, p41
1969

BURS77a
Burstall R.M. & Darlington J.
A Transformation System for Developing Recursive Programs
JACM Vol 24,No. 1,p44-67

BURS77b
Burstall R.M.
Design Considerations for a Functional Programming Language
pp 54-57
Proc. Infotech State of the Art Conference, Copenhagen, 1977

BURS80a *
Burstall R.M. & MacQueen D.B.  & Sannella D.T.
HOPE: An Experimental Applicative Language
Proc of LISP Conference Aug 1980
(Also Edinburgh report CSR-62-80, 1981)

BURS82a
Burstall R.M. & Goguen J.A.
Algebras, Theories and Freeness: An Introduction For Computer Scientists
in BROY82a, pp 329-348
1982

BURS84a *
Burstall R.M.
Programming with Modules as Typed Functional Programming
Proc. Int. Conf. on Fifth Gen. Computing Systems, Tokyo, Nov 84

BURT84a
Burton F.W.
Annotations to Control Parallelism and Reduction Order in the Distributed 
Evaluation of Functional Programs
ACM TOPLAS Vol 6 No. 2 April 1984 p159-174
1984

BURT85a *
Burton F.W. & Huntbach M.M. & Kollias J.G.
Multiple Generation Text Files Using Overlapping Tree Structures
Computer Journal, Vol 28, no 4, pp 414-416
1985

BUSH79a
Bush V.J.
A Data Flow Implementation of Lucid
Msc Dissertation, Dept of Comp Sci, Univ. of Manchester, October 1979

BYTE85a *
Byte Magazine, August 1985.
Special Issue on Declarative Languages
1985

CAMP84a *
ed. Campbell J.A.
Implementations of Prolog
Ellis Horwood Series Artificial Intelligence
Ellis Horwood 1984

CARD?? *
Cardelli L.
A Semantics of Multiple Inheritance

CARD84a *
Cardelli L.
Compiling a Functional Language
Proceedings of 1984 ACM Symposium on Lisp and Functional Programming,
Austin, Texas
pp 208-217
August 1984

CARD85a *
Cardelli L.
Amber
Proceedings of the Treizieme Ecole de Printemps d'Informatique Theorique,
Le Val D'Ajol, Vosges, France
May 1985

CARD??
Cardelli L.
The Amber Machine

CART79a *
Cartwright R. & McCarthy J.
First Order Programming Logic
Proceedings ACM 6th Symposium on Principles of Programming Languages
pp 68-80
1979

CART83a *
Cartwright R. & Donahue J.
The Semantics of Lazy (and Industrious) Evaluation
CSL-83-9 , Xerox PARC 1983

CAT81a
Catto A.J.
Nondeterministic Programming in a Dataflow Environment
PhD thesis, Dept of Comp Sci, Univ. of Manchester, June 1981

CHAM84a *
eds. Chambers F.B. & Duce D.A. & Jones G.P.
Distributed Computing
Apic Studies in Data Processing no 20
Academic Press, 1984

CHAN84a
Chang J.H. & DeGroot D.
AND-Parallelism of Logic Programs Based on Static Data Dependency Analysis
Dept. of Electrical Eng. & Computer Sci, Univ. of California,Berkely,Sept 1984

CHEE85a *
Cheese A.B.
The Applicability of SKI(BC) Combinators in a Parallel Rewrite Rule Environment
Msc Thesis
Department of Computer Science, University of Manchester
October 1985

CHES80a *
Chester D.
HCPRVR: An Interpreter for Logic Programs
Proc 1st Annual National Conference on Artificial Intelligence
pp 93-95
1980

CHEW80a *
Chew P.
An Improved Algorithm for Computing with Equations
IEEE 21st Annual Symposium on Foundations of Computer Science
pp 108-117
1980

CHEW81a *
Chew P.
Unique Normal Forms in Term Rewriting Systems with Repeated Variables
13th Annual ACM Symposium on Theory of Computing (STOC) 
pp 7-18
1981

CHIK83a
Chikayama T.
ESP as Preliminary Kernel Language of Fifth Generation Computers
( Also in New Generation Computing, Vol 1, No 1, 1983 )
ICOT Research Center, Technical Report TR-005
1983

CHUR41a
Church A.
The Calculi of Lambda-Conversion
Princeton University Press, Princeton, N.J., 1941

CLAC85a *
Clack C. & Peyton-Jones S.
Strictness Analysis - A Practical Approach
in Proc. IFIP Conf. on Functional Programming Languages and
Computer Architecture, Sept 16-19 '85, Nancy, France
1985

CLAR77a
Clark K.L. & Sickel
Predicate Logic: A Calculus For Deriving Programs
Proc. 5th Int. Joint Conf. on Artif. Intell., Cambridge, Mass 1977

CLAR77b
Clark K.L. & Tarnlund S. -A.
A First Order Theory of Data and Programs
Proc. IFIP 1977, pp 939-944
Amsterdam: North Holland

CLAR78a
Clark K.L.
Negation As Failiure
In "Logic and Databases", pp 293-322
New York: Plenum Press, 1978

CLAR79a
Clark K.L. & McCabe F.
The Control Facilities of IC-Prolog
Internal Report, Dept of Computing, Imperial College
1979

CLAR79b
Clark D.W.
Measurements of Dynamic List Structure Use in LISP
IEEE TOSE Vol SE-5 No 1, Jan 1979

CLAR80a
Clark K.L. & Darlington J.
Algorithm Classification Through Synthesis
Computer Journal, 61-65, 1980

CLAR80b *
Clarke J.W. & Gladstone P.J.S. & Maclean C.D. & Norman A.C.
SKIM - S,K,I Reduction Machine
Proceedings LISP Conference, Stanford, 1980

CLAR80c *
Clark J.H.
Structuring A VLSI System Architecture
Lambda, second quarter, 1980 , pp25-30
1980

CLAR80d *
Clark K.L. & McCabe F.G.
IC-PROLOG: Aspects of its Implementation
Proceedings of Logic Programming Workshop, Debrecen
1980

CLAR81a
Clark D.W. & Lampson B.W. & McDaniel G.A. & Ornstein S.M.
The Memory System of a High-Performance Personal Computer
CSL-81-1 , Xerox PARC, Jan 1981

CLAR82a *
Clark K.L. & Tarnlund S. -A.
Logic Programming
London: Academic Press, 1982

CLAR82b *
Clark T.S.
S-K Reduction Engine For An Applicative Language
Dept of Comp Sci, University of Illinois at Urbana-Champaign
Report no UIUCDCS-R-82-1119, UILU-ENG 82 1741
December 1982

CLAR83a *
Clark K. & Gregory S.
PARLOG: A Parallel Logic Programming Language (Draft)
Research Report DOC 83/5, Dept. of Computing, Imperial College

CLAR84a *
Clark K. & Gregory S.
PARLOG: Parallel Programming in Logic
Research Report DOC 84/4, Dept. of Computing, Imperial College

CLAR84b
Clark K.L. & McCabe F.G.
Micro-Prolog: Programming in Logic
Prentice Hall International Series in Computer Science
January 1984

CLAR85a
Clarke E.M. Jr.
The Characterization Problem For Hoare Logics
in HOA85a
1985

CLAY84a
Clayton B.D.
ART Programming Primer
Inference Corporation, 1984

CLOC81a *
Clocksin W.F. & Mellish C.S.
Programming in PROLOG
Springer Verlag 1981 (2nd Edition 1984)

CLOC83a *
Clocksin W.F.
Hortus Logico-Calculus
Notes for Tutorial Session on Declarative Languages and Architectures 1983

CLOC83b *
Clocksin W.F.
The ZIP Virtual Machine
Computer Laboratory, University of Cambridge

CLOC84a
Clocksin W.F.
Memory Representation Issues for Prolog Implementation
Computer Laboratory, University of Cambridge

CLOC84b *
Clocksin W.F.
Notes on FlexiFlow
Computer Laboratory, University of Cambridge Jan. 1984

CLOC84c *
Clocksin W.F.
On a Declarative Constraint Language
Computer Laboratory, University of Cambridge Jan. 1984

CLOC84d *
Clocksin W.F.
What is Prolog-X?
Computer Laboratory, University of Cambridge

CLOC85a *
Clocksin W.F.
Implementation Techniques for Prolog Databases.
Software - Practise and Experience Vol 15(7), pp 669-675
July 1985

CLOC85b *
Clocksin W.F.
Logic Programming and the Specification of Circuits
Computer Laboratory, University of Cambridge
Technical Report no 72
1985

COEL83a *
Coelho H.
Prolog: A Programming Tool For Logical Domain Modelling
in Processes and Tools for Decision Suport
(ed Sol H.G.), pp 37-45
North Holland
1983

COHE81a
Cohen J.
Garbage Collection of Linked Data Structures
ACM Computing Surveys Vol 13 No.3 Sept 1981, pp 341-367

COLL60a
Collins G.E.
A Method For Overlapping and Erasure of Lists
CACM 3, no 12, pp 655-657
1960

COLM73a
Colmerauer A. & Kanoui H. & Pasero R. & Roussel P.
Un Systeme de Communication Homme-machine en Francais
Group Intelligence Artificielle
Universite d,Aix Marseille, Luminy, 1973

CONE83a
Conery J.S.
The AND/OR Process Model for Parallel Execution of Logic Programs
Phd Dissertation, Univ of California, Irvine,
Tech rep 204, Information and computer science
1983

COOM84a *
ed. Coombs M.J.
Developments in Expert Systems
Academic Press 1984

CORN79a *
Cornish M. et al
The TI Data Flow Architectures: The Power of Concurrency For Avionics
Proc. 3rd Digital Avionics Systems Conf., pp 19-25
November 1979

CORY84a
Cory H.T. & Hammond P. & Kowalski R.A. & Kriwaczek F. & Sadri F.
& Sergot M.
The British Nationality Act As A Logic Program
Dept of Computing, Imperial College, London
1984

COST84a *
Costa G.
A Metric Characterization of Fair Computations in CCS
Department of Computer Science, University of Edinburgh
Internal Report CSR-169-84
October 1984

COST85a *
Costa G. & Stirling C.
Weak and Strong Fairness in CCS
Department of Computer Science, University of Edinburgh
Internal Report CSR-167-85
January 1985

COX83a
Cox Brad J.
Object Oriented Programming in C
Unix review, October/Novemeber 1983 Page 67
             
COX84a
Cox Brad J.
Object Oriented Programming in C
Unix Review, February/March 1984 Page 56

COUR82a
Courcelle B.
Fundamental Properties of Infinite Trees
in BROY82a, pp 417-470
1982

COUR84a
ed. Courcelle B.
Ninth Colloquium on Trees in Algebra and Programming
CUP 1984

COUS85a
Cousineau G. & Curien P. -L. & Mauny M.
The Categorical Abstract Machine
CNRS-Universite Paris VII LITP
85-8
January 1985

CRAM *
Crammond J.A. & Miller C.D.F.
An Architecture For Parallel Logic Languages
2nd International Logic Programming Conference
pp 183-194

CRAM85a *
Crammond J.A.
A Comparative Study of Unification Algorithms for OR_Parallel Execution of
Logic Languages
IEEE Transactions on Computers, Vol c-34, no 10, pp 911-917
October 1985

CURI85a
Curien P. -L.
Typed Categorical Combinatory Logic
CNRS-Universite Paris VII LITP
85-15
February 1985

CURI85b
Currien P. -L.
Categorical Combinators, Sequentials Algorithms and Functional Programming
CNRS-Universite Paris VII LITP
85-26
March 1985

CURR58a
Curry H.B. & Feys R.
Combinatory Logic, Vol 1
North Holland Publishing Company, Amsterdam, 1958

CURR72a
Curry H.B & Hindley J.R. & Seldin J.P.
Combinatory Logic, Vol II
North Holland Publishing Company, Amsterdam, 1972

DA83a
Da Silva J.G.D. & Watson I.
A Pseudo Associative Store with Hardware hashing
Proc. IEE, Part E, 1983

DAM82a
Damas L. & Milner R.
Principal Type Schemes For Functional Programs
Proc. ACM Symposium on Principles of Programming Languages,
pp 207-212, 1982

DARL75a
Darlington J.
Application of Program Transformation to Program Synthesis
Proc of International Symposium on Proving and Improving Programs,
Arc et Senans, France
1975

DARL76a
Darlington J. & Burstall R.M.
A System that Automaticaly Improves Programs
Acta Informatica, Vol 6,p41-60

DARL77a
Darlington J.
Program Transformation and Synthesis Present Capabilities
Report 77/43
Dept of Computing, Imperial College
(Also in Artificial Intelligence Journal Vol 16, 1981)
1977

DARL79a
Darlington J.
A Synthesis of Several Sorting Algorithms
Acta Informatica, Vol 11, no 1
1979

DARL80a
Darlington J.
An Abstract Scheme For a Multiprocessor Implementation of Applicative
Languages
Proc. of Joint SRC/Newcastle Univ. Workshop on VLSI, 
Machine Architecture and Very High Level Languages
1980

DARL80b
Darlington J.
Synthesis of Implementations For Abstract Data Types
Report 80/4
Dept of Computing, Imperial College
1980

DARL80c
Darlington J.
The Design of Efficient Data Representations
Dept of Computing, Imperial College
1980

DARL81a
Darlington J.
The Structured Description of Algorithm Derivations
To Appear in Amsterdam Conf. on Algorithms
October 1981

DARL81b *
Darlington J. & Reeve M.
ALICE- A Multi-Processor Reduction Machine for the Parallel Evaluation of Applicative Languages
Proc of 1981 ACM Conf on Functional Programming Languages & Computer Architecture 

DARL82a
Darlington J. & Henderson P. & Turner D.A.
Functional Programming and its Applications- An Advanced Course
Cambridge University Press 1982

DARL82b
Darlington J.
Program Transformation
in DARL82a
1982

DARL83a *
Darlington J.
The New Programming:Functional & Logic Languages
Distributed Computing- A Review for Industry, SERC, Manchester 1983

DARL83b *
Darlington J. & Reeve M.
ALICE- and the Parallel Evaluation of Logic Programs
Invited Paper, 10th Annual Int. Symposium on Computer Architecture,1983

DARL83c *
Darlington J.
Unification of Logic and Functional Languages
Dept. of Computing, Imperial College, Date Unknown

DARL85a *
Darlington J. & Field A.J. & Pull H.
The Unification of Functional and Logic Languages
Department of Computing, Imperial College
Doc 85/3
February 1985

DAVI78a
Davis A.L.
The Architecture and System Method of DDM1: A Recursively Structured
Data Driven Machine
Proc. 5th Int. Symp on Comp. Arch., pp 210-215
April 1978

DEGR84a
DeGroot D.
Restricted And-Parallelism
Proc. Int. Conf. 5th Generation Computer Systems, 1984,
pp 471-478
1984

DEGR85a *
DeGroot D.
Alternate Graph Expressions for Restricted And-Parallelism
IEEE Spring Compcon 1985, pp 206-210
1985

DEGR85b *
DeGroot D. & Chang J-H
Une Comparison de Deux Modeles d'Execution de Parallelisme "et" a
Comparison of Two And-Parallel Execution Models
Hardware and Software Components and Architectures for the 5th
Generation, March 5-7 1985, pp 271-280
1985

DELI79a
Deliyanni A. & Kowalski R.A.
Logic and Semantic Networks
CACM Vol 22,No 3,p184-192

DEN75a
Dennis J.B. & Misunas D.P.
A Preliminary Architecture for a Basic Dataflow Processor
Proc. 2nd Annual Symposium on Computer Architecture
SIGARCH vol 3, no 4 , Jan 75, pp 126-132
1975

DEN79a
Dennis J.B.
The Varieties of Data Flow Computers
MIT Computation Structures Group, Memo 183, August 1979

DELV85a *
Delves L.M. & Mawdsley S.C.
DAP-Algol: A Development System for Parallel Algorithms
Computer Journal, Vol 28, no 2, pp 148-153
1985

DERT84a
Derthick M.
Variations on the Boltzmann Machine Learning Algorithm
CMU-CS-84-120
Dept of Comp Sci, Carnegie-Mellon Univ
August 1984

DETT86a *
Dettmer R.
Flagship A Fifth Generation Machine
Electronics and Power, pp 203-208
March 1986

DEU76a
Duetsch & Peter L. & Bobrow & Daniel G.
An Efficient, Incremental, Automatic Garbage Collector
CACM Vol 19,no 9, pp 522-526, 1976

DIJK82a
Dijkstra E.W.
Lambek and Moser Revisited
in BROY82a, pp 19-22
1982

DIJK82b
Dijkstra E.W.
Repaying our Debts
in BROY82a, pp 135-141
1982

DIJK82c
Dijkstra E.W.
A Tutorial on the Split Binary Semaphore
in BROY82a, pp 555-564
1982

DIJK85a
Dijkstra E.W.
Invariance and Non-Determinacy
in HOA85a
1985

DONA85a *
Donahue J. & Demers A.
Data Types Are Values
ACM Transactions on Programming Languages and Systems, vol 7, no 3
pp 426-445
July 1985

DOWN76a
Downey P.J. & Sethi R.
Correct Computation Rules For Recursive Languages
SIAM Journal of Computing 5(3), pp 378-401, September 1976

DUCE84a *
ed. Duce D.A.
Distributed Computing Systems Programme
IEE Digital Electronics and Computing Series no 5
Peter Peregrinus Ltd., 1984

DUCK85a *
Duckworth R.J. & Brailsford D.F. & Harrison L.
A Structured Data Flow Computer
Internal Report, Comp Sci Group, Univ of Nottingham
October 14, 1985

EGA79a
Egan G.K.
Data Flow: Its Applications to Decentralised Control
PhD Thesis, Dept of Comp Sci, Univ. of Manchester, 1979

ELIT84a
eds. Elithorn A. & Banerji R.
Artificial and Human Intelligence: Symposium
North Holland 1984

ENNA82a
Ennals J.R.
Beginning Micro-Prolog
Ellis Horwood Series Artificial Intelligence
Ellis Horwood Ltd., 1982

ENOM84a
Enomoto H. & Yonezaki N. & Saeki M. & Chiba K. & Takizuka T. & Yokoi T.
Natural Language Based System Development System TELL
ICOT Research Center, Technical Report TR-067
June 1986

ENOM84b
Enomoto H. & Yonezaki N. & Saeki M.
Formal Specification and Verification for Concurrent Systems by TELL
ICOT Research Center, Technical Report TR-068
June 1986

FAGE83a
Fages F. & Huet G.P.
Complete Sets Of Unifiers And Matches In Equational Theories
Proc. 8th Colloquium on Trees In Algebra And Programming
Springer Verlag, LNCS 159, pp 205-220, 1983

FAHL83a
Fahlman S.E. & Hinton G.E. & Sejnowski T.J.
Massively Parallel Architectures for AI: NETL,THISTLE,and Boltzmann Machines
Proc. National Conf. on Artificial Intelligence, Aug 1983 p109-113

FAIR82a
Fairburn J.
Ponder, And Its Type System
Cambridge Computer Lab Technical Report 31, 1982

FAIR85a *
Fairbairn J.
Design and Implementation of a Simple Typed Language Based on the Lambda
Calculus
Computer Laboratory, University of Cambridge, Tech Rep no 75
(also submitted as PhD thesis in December 1984)
1985

FARR79a
Farrell E.P. et al
A Concurrent Computer Architecture and Ring Based Implementation
Proc 6th Int. Symp. on Comp. Arch., pp 1-11
April 1979

FAUS83a
Faustini A.A. Mathews S.G. & Yaghi A.G
The pLUCID Programming Manual
University of Warwick Distributed Computing Report No. 4 ,1983

FEHR84a *
Fehr E.
Expressive power of Typed and Type-Free Programming Languages
Theoretical Computer Science 33 (1984) pp 195-238
North Holland
1984

FEHR84b *
Fehr E.
Dokumentation eines PROLOG-Interpreters implementiert in der funktionalen
Sprache BRL
GMD Nr 122
November 1984

FILG82a *
Filgueiras M.
On The Implementation of Control in Logic Programming Languages
Universidade Nova de Lisboa, Tech rep UNL 8/82
1982

FINN85a *
Finn S.
The Simplex Programming Language
Department of Computing Science, University of Stirling
27th March 1985

FOLE?
Foley J.
A Multi-Ring Dataflow Machine
PhD Thesis, Dept of Computer Science, Univ. of Manchester
In Preparation

FOO86a *
Foo N.Y.
Dewey Indexing of Prolog Traces
Computer Journal, Vol 29, no 1, pp 17-19
1986

FREI74a
Freidman D.P.
The Little LISPer
Science Research Associates, Palo Alto
1974

FREI76a *
Freidman D.P. & Wise D.S.
CONS Should Not Evaluate Its Arguments
Proceedings 3rd International Colloquium on Automata Languages and Programming
pp 257-284
Edinburgh University Press, 1976

FREI77a
Freidman D.P. & Wise D.P.
Applicative Multiprogramming
Tech rep no 72, Indiana univ., Bloomington
1977

FREI77b
Freidman D.P. & Wise D.S.
Aspects of Applicative Programming for File Systems
SIGPLAN notices Vol 12 no 3 march 77 pp 41-55
1977

FREI78a
Friedman D.P. Wise D.S.
A Note on Conditional Expressions
CACM  21(11), pp 931-933, November 1978

FREI78b *
Freidman D.P. & Wise D.S.
Functional Combination
Computer Languages, 3, pp 31-35
1978

FREI78c
Freidman D.P. & Wise D.S.
Unbounded Computational Structures
Software, Practise and Experience, 8, pp 407-415
1978

FREI79a *
Freidman D.P. & Wise D.S.
Reference Counting Can Manage The Circular Environments of Mutual Recursion
Information Processing Letters, 8, no 2, pp 921-930
1979

FREI80a
Freidman D.P. & Wise D.S.
An Indeterminate Constructor for Applicative programming
Conf. Record of ACM Symp. on Princ. of Prog. Langs., Las Vegas
1980

FROS85a *
Frost R.A.
Using Semantic Concepts to Characterise Various Knowledge Representation
Formalisms: A Method of Facilitating the Interface of Knowledge Base 
System Components
Computer Journal, Vol 28, no 2, pp 112-116
1985

FUJI83a
Fujita M. & Tanaka H. Moto-oka T.
Verification with PROLOG and Temporal Logic
Faculty of Eng. Univ. of Tokyo

FURU83a *
Furukawa K. & Takeuchi A. & Kunifuji S.
Mandala: A Concurrent Prolog Based Knowledge Programming Language System
ICOT Research center, Technical Report TR-029
November 1983

FURU83b *
Furukawa K. & Nakajima R. & Yonezawa A.
Modularization and Abstraction in PROLOG
Document ETL
ICOT Research Center, Technical Report TR-022
( Also in New Generation Computing, Vol 1, No 2, 1983 )
August 1983

FURU83c 
Furukawa K.
Mandala: A Knowledge Programming Language on Concurrent Prolog
ICOT Research Center, Technical Memorandum TM-0028
October 1983

FURU84a *
Furukawa K. & Kunifuji S. & Takeuchi A. & Ueda K.
The Conceptual Specification of the Kernel Language Version 1
( Also in Workshop on Implementation of Concurrent Prolog, Rehovot, 1984 )
ICOT Research Center, Technical Report TR-054
March 1984

FURU84a *
Furukawa K. & Takeuchi A. & Kunifuji S. & Yasukawa H. & Ohki M. & Ueda K.
Mandala: A Logic Based Knowledge Programming System
( Also in Second Japanese Swedish Workshop on Logic Programming and
  Functional Programming, Uppsala, 1984 )
ICOT Research Center, Technical Report TR-076
August 1984

FUTA85a
Futatsugi K. & Goguen J.A. & Jouannaud J-P & Meseguer J.
Principles of OBJ2
In Proc. 1985 Principles of Programming Languages
1985

GIER80a
Gierz G. & Hofmann K.H. & Keimel K. & Lawson J.D. & Mislove M. & Scott D.S.
A Compendium of Continuous Lattices
Springer Verlag
1980

GLAS84a *
Glaser H. & Hankin C. & Till D.
Principles of Functional Programming
Prentice Hall International, 1984

GLAU78a
Glauert J.R.W.
A Single-Assignment Language for Data Flow Computing
MSc Dissertation, Dept of Comp Sci, Univ. of Manchester, January 1978

GLAU85a *
Glauert J.R.W. & Holt N.P. & Kennaway J.R. & Sleep M.R.
An Active Term Rewrite Model for Parallel Computation
Document, Alvey DACTL group, March 1985

GLAU85b *
Glauert J.R.W. & Holt N.P. & Kennaway J.R. & Sleep M.R.
DACTL Report 3/5
Document, Alvey DACTL group, March 1985

GLAU85c *
Glauert J.R.W. & Holt N.P. & Kennaway J.R. & Reeve M.J. &
Sleep M.R. & Watson I.
DACTL0: A Computational Model and an Associated Compiler Target Language
University of East Anglia 
May 1985

GOEB85a
Goebel R.
The Design and Implementation of DLOG, a Prolog-Based Knowledge Representation
System
New Generation Computing, Vol 3, No 4, pp 385-401
1985

GOGU67a
Goguen J.A.
L-Fuzzy Sets
Journal of Mathematical Analysis and Applications
Vol 18 no 1, pp 145-174
1967

GOGU68a
Goguen J.A.
Categories of Fuzzy Sets
Phd Dissertation
Dept. of mathematics, Univ. of california, berkeley
1968

GOGU68b
Goguen J.A.
The Logic of Inexact Concepts
Synthese, Vol 19, pp 325-373
1968-69

GOGU69a
Goguen J.A.
Categories of V-Sets
Bulletin of the American Mathematical Society,
Vol 75, no 3, pp 622-624
1969

GOGU71a
Mathematical Representation of Hierarchically organised Systems
in "Global Systems Dynamics"
(ed. Attinger E. & Karger S.)
Basel, Switzerland
pp 112-128
1971

GOGU72a
Goguen J.A.
Systems and Minimal Realisation
Proc. IEEE Conf. on Decision and Control,
Miami Beach, Florida
pp 42-46
1972

GOGU72b
Goguen J.A.
Minimal Realisation of Machines in Closed Categories
Bulletin of the American Mathematical Society
Vol 78, no 5, pp 777-783
1972

GOGU72c
Goguen J.A.
Hierarchical Inexact Data structures in Artificial Intelligence Problems
Proc. 5th Hawaii Int. Conf. on System Sciences
Honolulu, Hawaii, pp 345-347
1972

GOGU72d
Goguen J.A. & Yacobellis R.H.
The Myhill Functor, Input-Reduced Machines, and Generalised 
Krohn-Rhodes Theory
Proc. 5th Princeton Conf. on Information Sciences and Systems
Princeton, New Jersey
pp 574-578
1972

GOGU72e
Goguen J.A.
On Homomorphisms, Simulation, Correctness and Subroutines for
programs and Program schemes
Proc. 13th IEEE Symp. on Switching and Automata Theory
College Park, Maryland
pp 52-60
1972

GOGU73a
Goguen J.A.
Realisation is Universal
mathematical System Theory
Vol 6, no 4, pp 359-374
1973

GOGU73b
Goguen J.A.
System theory concepts in Computer Science
Proc. 6th Hawaii Int. Conf. on Systems Sciences
Honolulu, Hawaii, pp 77-80
1973

GOGU73c
Goguen J.A.
The Fuzzy Tychonoff Theorem
Journal of mathematical Analysis and applications
vol 43, pp 734-742
1973

GOGU73d
Goguen J.A.
Categorical Foundations for general Systems Theory
in "Advances in Cybernetics and Systems research"
(ed. Pichler F. & Trappl R.)
Transcripta Books, London
pp 121-130
1973

GOGU74a
Goguen J.A.
Semantics of Computation
Proc. 1st Int. Symp. on Category Theory Applied to Computation and Control
(1974 American Association for the Advancement of Science, San francisco)
Univ. of massachusetts at Amherst, 1974, pp 234-249
also published in LNCS vol 25, pp 151-163, springer-verlag
1975

GOGU74b
Goguen J.A. & Thatcher J.W.
Initial Algebra Semantics
proc. 15th IEEE Symp. on Switching and Automata
pp 63-77
1974

GOGU74c
Goguen J.A.
Concept Representation in Natural and Artificial languages: Axioms,
extensions and Applications for Fuzzy sets"
Int. Journal of man-Machine Studies
vol 6, pp 513-561
1974
reprinted in "Fuzzy Reasoning and its Applications"
(ed. Mamdani E.H. & Gaines B.R.)
pp 67-115
Academic Press 
1981

GOGU74d
Goguen J.A.
On Homomorphisms, Correctness, termination, Unfoldments and
Equivalence of Flow Diagram Programs"
Journal of Computer and System Sciences,
vol 8, no 3, pp 333-365
1974

GOGU74e
Goguen J.A.
Some Comments on Applying Mathematical System Theory
in "Systems Approaches and Environmental Problems"
(ed. Gottinger H.W. & Vandenhoeck & Rupert)
pp 47-67
(Gottingen, Germany)
1974

GOGU75a
Goguen J.A. & Thatcher J.W. & Wagner E.G. & Wright J.B.
Factorisation, Congruences, and the Decomposition of Automata and
Systems
in "Mathematical Foundations of Computer Science"
LNCS Vol 28, pp 33-45, Springer-Verlag
1975

GOGU75b
Goguen J.A.
Objects
International Journal of general systems, vol 1, no 4,
pp 237-243
1975

GOGU75c
Goguen J.A.
Discrete-Time Machines in Closed Monoidal Categories, I,
Journal of Computer and System sciences, Vol 10, No 1, February,
pp 1-43
1975

GOGU75c
Goguen J.A. & Thatcher J.W. & Wagner E.G. & Wright J.B.
Abstract Data types as Initial algebras and the Correctness of
Data Representations
Proc. Conf. on Computer Graphics, Pattern recognition, and Data Structure
(Beverly Hills, California), pp 89-93
1975

GOGU75d
Goguen J.A. & Carlson L.
Axioms for Discrimination Information
IEEE Transactions on Information Theory, Sept '75
pp 572-574
1975

GOGU75e
Goguen J.A.
On Fuzzy Robot Planning
in "Fuzzy Sets and Their Applications to Cognitive and Decision Processes
(ed. Zadeh L.A. & Fu K.S. & Tanaka K. & Shimura M.)
pp 429-448
Academic Press
1975

GOGU75f
Goguen J.A.
Robust Programming Languages and the Principle of Maximum
Meaningfulness
Proc. Milwaukee Symp. on Automatic Computation and Control
(Milwaukee, Wisconsin)
pp 87-90
1975

GOGU75g
Goguen J.A.
Complexity of Hierarchically Organised Systems and the Structure of
Musical Experiences
Int. Journal of General Systems, vol 3, no 4, 1975, pp 237-251
originally in UCLA Comp. Sci. Dept. Quarterly, October 1975, pp 51-88
1975

GOGU76a
Goguen J.A. & Thatcher J.W. & Wagner E.G. & Wright J.B.
Some Fundamentals of Order-Algebraic Semantics
Proc. 5th Int. Symp. on Mathematical Foundations of Computer Sciences
(Gdansk, Poland, 1976)
LNCS vol 46, 1976, pp153-168, Springer-Verlag
1976

GOGU76b
Goguen J.A. & Thatcher J.W. & Wagner E.W. & Wright J.B.
Parallel Realisation of Systems, Using Factorisations and Quotients in
Categories
Journal of Franklin Institute, vol 301, no6, June '76, pp 547-558
1976

GOGU76c
Goguen J.A.
Correctness and Equivalence of Data Types
Proc Symp. on Mathematical Systems Theory (Udine, Italy)
Springer Verlag Lecture Notes
(ed. Marchesini G.)
pp 352-358
1976

GOGU76d
Goguen J.A. & Thatcher J.W. & Wagner E.G. & Wright J.B.
Rational Algebraic Theories and Fixed-point Solutions
Proc. IEEE 17th Symp on Foundations of Computer Science
(Houston, Texas), 1976, pp 147-158
1976

GOGU77a
Goguen J.A. & Thatcher J.W. & Wagner E.G. & Wright J.B.
Initial Algebra Semantics and Continuous Algebras
JACM, vol 24, no 1, January 1977, pp 68-95
1977

GOGU77b
Goguen J.A.
Abstract Errors for Abstract Data Types
in "Formal Descriptions of Programming Concepts"
(ed. E.Neuhold)
North-Holland, 1978, pp 491-522
also in
Proc. IFIP Working Conf. on Formal Description of Programming
Concepts
(ed. Dennis J.)
MIT Press, 1977, pp 21.1-21.32
1977

GOGU77c *
Goguen J.A. & Burstall R.M.
Putting Theories Together to Make Specifications
Proc. 5th Int. Joint Conf. on Artificial Intelligence
(MIT, Cambridge, Massachusetts), 1977, pp 1045-1058
1977

GOGU77d
Goguen J.A. & Meseguer J.
Correctness of Recursive Flow Diagram Programs
Proc. Conf. on Mathematical Foundations of Comp. Sci.
(Tatranska Lomnica, Czechoslovakia)
pp 580-595
1977

GOGU77e
Goguen J.A.
Algebraic Specification Techniques
UCLA Comp. Sci. Dept. Quarterly
Vol 5, no 4
pp 53-58
1977

GOGU78a
Goguen J.A. & Varela F.
The Arithmetic of Closure
Journal of Cybernetics, Vol 8, 1978
also in "Progress in Cybernetics and Systems research, vol 3"
(ed. Trappl R. & Klir G.J. & Ricciardi L.)
Hemisphere Pub Co. (Washington D.C.)
1978

GOGU78b
Goguen J.A. & Ginali S.
A Categorical Approach to General Systems
in "Applied General Systems research"
(ed. Klir G.)
Plenum Press
pp 257-270
1978

GOGU78c
Goguen J.A. & Thatcher J.W. & Wagner E.G.
An Initial Algebra Approach to the Specification, Correctness and
Implementation of Abstract data Types
in "Current Trends in Programming, vol 4, Data Structuring" 
pp 80-149
(ed. Yeh R.)
Prentice Hall
1978

GOGU78d
Goguen J.A.
Some Design Principles and Theory for OBJ-0, a Language for Expressing
and Executing Algebraic Specifications of Programs
Proc. Int. Conf. on Mathematical Studies of Information Processing
(Kyoto, Japan)
pp 429-475
1978

GOGU78e
Goguen J.A. & Linde C.
Structure of Planning Discourse
Journal of Social and Biological Structures, Vol 1
pp 219-251
1978

GOGU79a
Goguen J.A. & Shaket E.
Fuzzy Sets at UCLA
Kybernetes, vol 8
pp 65-66
1979

GOGU79b
Goguen J.A. & Varela F.
Systems and Distinctions; Duality and Complementarity
International Journal of General Systems, vol 5
pp 31-43
1979

GOGU79c
Goguen J.A. & Tardo J.J.
An Introduction to OBJ: A Language for writing and Testing formal
algebraic specifications
Reliable Software Conf. Proc. (ed. Yeh R.)
(Cambridge, Massachusetts)
pp 170-189
Prentice Hall
1979

GOGU79d
Goguen J.A.
Algebraic Specification
in "Research Directions in Software Technology"
(ed. Wegner P.)
pp 370-376
MIT Press
1979

GOGU79e
Goguen J.A.
Some Ideas in Algebraic Semantics
Proc. 3rd IBM Symp on Mathematical Foundations of Computer Science
(Kobe, Japan)
53 pages
1979

GOGU79f
Goguen J.A.
Fuzzy Sets and the Social Nature of Truth
in "Advances in Fuzzy Set Theory and Applications"
(eds. Gupta M.M. & Yager R.)
pp 49-68
North-Holland Press
1979

GOGU79g
Goguen J.A. & Tardo J. & Williamson N. & Zamfir M.
A Practical Method for Testing Algebraic Specifications
UCLA Computer Science Quarterly, Vol 7, no 1
pp 59-80
1979

GOGU80a
Goguen J.A.
Thoughts on Specification, Design and Verification
Software Engineering Notes, Vol 5, no 3
pp 29-33
1980

GOGU80b
How to Prove Algebraic Inductive Hypotheses Without Induction: with
Applications to the Correctness of Data Type Implementation
Proc. 5th Conf. on Automated Deduction, (Les Arcs, France)
(eds. Bibel W. & Kowalski R.)
LNCS, vol 87
pp 356-373
Springer Verlag
1980

GOGU80c
Goguen J.A. & Burstall R.M.
The Semantics of CLEAR, a Specification Language
in "Abstract Software Specification"
(eds Bjorner D.)
(Proc. 1979 Copenhagen Winter School)
LNCS, vol 86
pp294-332
1980

GOGU80d
Goguen J.A. & Linde C.
On the Independence of Discourse Structure and Semantic Domain
Proc. 18th Annual Meeting of the Association for Computational
Linguistics, Parasession on Topics in Interactive Discourse
(Univ. of Pennsylvania, Philadelphia, Pennsylvania)
pp 35-37
1980

GOGU81a
Goguen J.A. & Parsaye-Ghomi K.
Algebraic Denotational Semantics Using Parameterised Abstract Modules
Proc. Int. Conf on Formalising Concepts
(Peniscola, Spain)
(ed. Diaz J. & Ramos I.)
LNCS, vol 107
pp 292-309
Springer verlag
1981
 
GOGU81b
Goguen J.A. & Burstall R.M.
An Informal Introduction to CLEAR, a Specification Language
in "The Correctness Problem in Computer Science"
(eds. Boyer R. & Moore J.)
pp 185-213
Academic Press
1981

GOGU81c
Goguen J.A. & Meseguer J.
Completeness of many-Sorted Equational Logic
SIGPLAN Notes, Vol 16, no 7, pp 24-32, 1981
also in SIGPLAN Notes, vol 17, no 1, pp 9-17, 1982
extended version as Tech Rep CSLI-84-15, Center for the Study of
Language and Information, Standford Univ.,
September 1984

GOGU82a
Goguen J.A.
ORDINARY Specification of KWIC Index Generation
Proc Workshop on Program Specification
(ed. Staunstrup J.)
LNCS, Vol 134
pp 114-117
Springer Verlag
1982

GOGU82b
Goguen J.A.
ORDINARY Specification of Some Constructions in Plane Geometry
Proc Workshop on Program Specification
(ed. Staunstrup J.)
LNCS, Vol 134
pp 31-46
Springer verlag
1982

GOGU82c
Goguen J.A. & Burstall R.M.
Algebras, Theories and Freeness: An Introduction for Computer Scientists
in "Theoretical Foundations of Programming Methodology"
(eds. Broy M. & Schmidt G.)
pp 329-348
D. Reidel
1982

GOGU82d
Goguen J.A. & Meseguer J.
Security Policies and Security Models
Proc 1982 Berkeley Conf on Computer Security
IEEE Computer Society Press
pp 11-20
1982

GOGU82e
Goguen J.A.
Universal Realisation, Persistent Interconnection and Implementation of
Abstract Modules
Proc 9th Int Colloquium on Automata, Languages and Programming
(Aarhus, denmark)
LNCS, Springer Verlag
1982

GOGU82f
Goguen J.A.
Rapid Prototyping in the OBJ Executable Specification Language
Proc Rapid Prototyping Workshop
(Columbia, Maryland)
1982
also in Software engineering Notes, ACM Special Interest
Group on Software engineering, vol 7, no 5, pp 75-84, 1983

GOGU83a
Goguen J.A. & Meseguer J. & Plaisted D.
Programming with Parameterised Abstract Objects in OBJ
in "Theory and practise of Software technology"
(eds. Ferrari D. & Bolognani M. & Goguen J.A.)
pp 163-193
North-Holland
1983

GOGU83b
Future Directions for Software Engineering
in "Theory and Practise of Software Technology"
(eds. Ferrari D. & Bolognani M. & Goguen J.A.)
pp 243-244
North-Holland
1983

GOGU83c
Goguen J.A. & Ferrari D. & Bologanani M.
Theory and Practise of Software Technology
North Holland
1983

GOGU83d
Goguen J.A. & Meseguer J.
Correctness of recursive Parallel Non-Deterministic Flow Programs
Journal of Computer and System Sciences, vol 27, no 2
pp 268-290
October 1983

GOGU83e
Goguen J.A.
Parameterised Programming
IEEE TOSE, vol SE-10, no 5, september 1984, pp 528-543
preliminary version in Proc. Workshop on Reusability in Programming,
ITT, pp 138-150
1983

GOGU83f
Goguen J.A. & Linde & Weiner J.
Reasoning and Natural explanation
International Journal of man-Machine Studies, Vol 19
pp 521-559
1983

GOGU83g
Goguen J.A. & Burstall R.M.
Introducing Institutions
Logics of programs
(Carnegie-mellon Univ., Pittsburgh PA, June 1983)
LNCS, vol 164, Springer Verlag
pp 221-256, 1984

GOGU84a
Goguen J.A. & Meseguer J.
Unwinding and Inference Control
1984 Symp on Security and privacy, IEEE, pp 75-86
1984

GOGU84b
Goguen J.A. & Meseguer J.
Equality, types, Modules and generics for Logic Programming
Tech Rep no. CSLI-84-5, Center for the Study of Logic and Information,
Stanford University, March 1984
also in Proc. 2nd int. Logic Programming Conf., Upsala, Sweden,
pp 115-125
1984

GOGU84c
Goguen J.A. & Bustall R.M.
Some Fundamental Properties of Algebraic Theories: A Tool for Semantics
of Computation, Part 1: Comma Categories, Colimits and Theories
Theoretical Computer Science, vol 31, no 2,
pp 175-209
1984

GOGU84d
Goguen J.A. & Burstall R.M.
Some Fundamental properties of Algebraic Theories: A Tool for Semantics
of computation, Part 2: Signed and Abstract theories
Theoretical Computer Science, vol 31, no 3
pp 263-295
1984

GOGU84e
Goguen J.A. & Meseguer J.
Equality, Types, Modules and (Why Not ?) Generics for Logic programming
Journal of Logic programming, vol 1, no 2
pp 179-210
1984

GOGU84f
Goguen J.A. & Murphy M. & Randle R.J. & Tanner T.A. & Frankel R.M. &
Linde C.
A Full Mission Simulator study of Aircrew performance: The measurement
of Crew Coordination and descisionmaking factors and their relationships
to Flight task performance
Proc. 20th Annual Conf on Manual control, vol II
(eds. Hartzell E.J. & Hart S.)
NASA Conference publication 2341, pp 249-262
1984

GOGU84g
Goguen J.A. & Linde C. & Murphy M.
Crew Communication as a factor in Aviation Accidents
Proc 20th Annual Conf on Manual control, vol II
(eds. Hartzell E.J. & Hart S.)
NASA Conference Publication 2341, pp 217-248
1984


GOGU85a
Goguen J.A. Meseguer J.
EQLOG: Equality, Types and Generic Modules for Logic Programming
In Functional and Logic Programming, Prentice Hall
1985

GOGU85b
Goguen J.A. & Jouannaud J-P & Meseguer J.
Operational Semantics for Order-Sorted Algebra
In Proc. ICALP 1985

GOGU85c
Goguen J.A. & Meseguer J.
Initiality, Induction and Computability
to appear in "Algebraic Methods in Semantics" 
(ed. Nivat M. & Reynolds J. )
Cambridge U.P.
chapter 14, pp 459-540 approx.
1985

GOGU85d
Goguen J.A. & Meseguer J.
Completeness of Many-Sorted Equational Logic
to appear in Houston Journal of Mathematics
1985

GOGU85e *
Goguen J.A. & Futatsugi K. & Jouannaud J.-P. & Meseguer J.
Principles of OBJ2
Proc 1985 Symp on Principles of programming languages, ACM
pp 52-66
1985

GOLD81a
Goldfarb W.
The Undecidability Of The Second Order Unification Problem
Theoretical Computer Science 13, pp 225-230, 1981

GOOD83a
Goodall A.
Language Of Intelligence (PROLOG)
Systems International p21-24 Jan 1983

GOOD85a
Good D.I.
Mechanical Proofs about Computer Programs
in HOA85a
1985

GORD79a *
Gordon M.J. & Milner R. & Wadsworth C.P.
Edinburgh LCF
Lecture Notes In Computer Science, Vol 78
Berlin: Springer Verlag, 1979

GORD85a *
Gordon M.
HOL : A Machine Oriented Formulation of Higher order Logic
Computer Laboratory, University of Cambridge
Technical Report no 68
July 16 1985

GOST79a
Gostelow K.P. & Thomas R.E.
A View of Dataflow
Proc. Nat. Comp. Conf., Vol 48, pp 629-636
1979

GOTO82a
Goto A. & Moto-oka T.
Basic Architecture of Highly Parallel Processing System for Inference
Document Univ. of Tokyo, Dec 1982

GREE85a *
Greene K.J.
A Fully Lazy Higher Order Purely Functional Programming Language with
Reduction Semantics
CASE Center Technical Report No. 8503
CASE Center, Syracuse University, New York
December 1985

GREG85a *
Gregory S.
Design, Application and Implementation of a Parallel Programming Language
PhD Thesis, Dept of Computing, Imperial College, Univ of London
September 1985

GRIE77a
Gries D.
An Exercise in Proving Parallel Programs Correct
CACM, 20, no 12, pp 921-930
1977

GRIS71a
Griswold R.E. & Poage J.F. & Polonsky J.P.
The Snobol-4 Programming Language
Prentice Hall
1971

GRIS84a *
Griswold R.E.
Expression Evaluation in the Icon Programming Language
Proceedings of 1984 ACM Symposium on Lisp and Functional Programming
Austin, Texas
pp 177-183
1984

GUES76a *
Guessarian I.
Semantic Equivalence of Program Schemes and its Syntactic Characterization
Proceedings 3rd International Colloquium on Automata Languages and Programming
pp 189-200
Edinburgh University Press, 1976

GUNN84a *
Gunn H.I.E. & Harland D.M.
Polymorphic Programming II. An Orthogonal Tagged High Level Architecture
Abstract Machine
Software - Practise and Experience, Vol 14(11), pp 1021-1046
November 1984

GURD78a *
Gurd J. & Watson I. & Glauert J.
A Multi-Layered Data Flow Computer Architecture
Internal Report, Dept of Comp Sci, Univ of Manchester
1978

GURD85a *
Gurd J. & Kirkham C.C. & Watson I.
The Manchester Prototype Dataflow Computer
CACM, vol 28, p 34-52, 
1985

GUTT75a
Guttag J.V. 
The Specification and Application to programming of Abstract Data Types
PhD dissertation, Univ. of Toronto, Dept of Comp Sci
1975

GUTT77a
Guttag J.V.
Abstract Data Types and the Development of Data Structures
CACM Vol 20, no 6, pp 396-404, June
1977

GUTT78a
Guttag J.V. & Horowitz E. & Musser D.R.
Abstract Data Types and Software Validation
CACM Vol 21, pp 1048-1064, december
also USC Information Sciences Institute Tech. Rep. Aug 76
1978

GUTT78b
Guttag J.V. & Horning J.J.
The Algebraic Specification of Abstract Data Types
Acta Informatica, 10, 1, pp 27-52
1978

GUTT80a
Guttag J.V.
Notes on Type Abstraction (version 2)
IEEE Trans. on Soft. Eng. Vol SE-6, no 1, pp 13-23, January
1980

GUTT82a
Guttag J.
Notes On Using Types and Type Abstraction In Functional Programming
in DARL82a
1982

GUZM81a *
Guzman A.
A heterarchical Multi-Microprocessor Lisp Machine
1981 IEEE Computer Society Workshop on Computer Architecture for Pattern
Analysis and Image Database Management, Hot Springs, Virginia
pp 309 -  317
November 11-13, 1981

HALI84a *
Halim Z.
A Data-/Demand-Driven Model for the Evaluation of PARLOG And-Relations and Conditional Equations
Document, Dept of Computer Science, Univ. of Manchester Jan 1984

HAMI85a *
Hamilton A.G.
Program Construction in Martin-Lof Type Theory
T.R. 24
Tech Rep, Dept of Comp Sci, Univ of Stirling
June 1985

HAMM83a
Hammond P. & Sergot M.
A Prolog Shell for Logic-Based Expert Systens
Proc. 3rd BCS Expert Systems Conf. pp 95-104,
1983

HAMM83b
Hammond P.
Representation of DHSS Regulations as a Logic Program
B.C.S. Expert Systems Conference 1983

HAMM84a
Hammond K.
The KRC Manual
CSA/16/1984, DSAG-3,
Univ. of East Anglia, May 1984.

HANK85a *
Hankin C.L. & Osmon P.E. & Shute M.J.
COBWEB - A Family of Fifth Generation Computer Architectures
25th January 1985

HANS79a
Hansson A. & Tarnlund S. -A.
A Natural Programming Calculus
Proc. 6th IJCAI, Tokyo, Japan, pp 348-355, 1979

HARL84a *
Harland D.M.
Polymorphic Programming Languages
Ellis Horwood 1984

HARR81a *
Harrison P.G.
Efficient Storage Management for Functional Languages
Dept of Computing, Imperial College, Research Report no DOC 81/12
August 1981

HASE84a
Hasegawa R.
A List Processing Orientated Data Flow Machine Architecture
Electrical Communication Lab, Nippon Telegraph and Telephone 
Public Corporation

HATT83a
Hattori T. & Yokoi T.
Basic Constructs of the SIM Operating System
( Also in New Generation Computing, Vol 1, No 1, 1983 )
ICOT Research Center, Technical Memorandum TM-0009
June 1986

HATT84a *
Hattori T. & Tsuji J. & Yokoi T.
SIMPOS: An Operating System for a Personal Prolog Machine PSI
ICOT Research Center, Technical Report TR-055
April 1984

HATT84b *
Hattori T. & Yokoi T.
The Concepts and Facilities of SIMPOS Supervisor
ICOT Research Center, Technical Report TR-056
April 1984

HATT84c
Hattori T. & Yokoi T.
The Concepts and Facilities of SIMPOS File System
ICOT Research Center, Technical Report TR-059
April 1984

HAYE84a
Hayes P.J.
Entity-Oriented Parsing
CMU-CS-84-138
Dept of Comp Sci, Carnegie-Mellon Univ.
9 June 1984

HEND76a *
Henderson P. & Morris J.M.
A Lazy Evaluator
Proceedings 3rd POPL Symposium, Atlanta Georgia, 1976, pp 95-103

HEND80a *
Henderson P.
Functional Programming: Application and Implementation
Prentice Hall 1980

HEND82a
Henderson P.
Purely Functional Operating Systems
in DARL82a
1982

HEND83a *
Henderson P. & Jones G.A. & Jones S.B.
The Lispkit Manual, vol 1 and vol 2 (sources)
Oxford University Programming Research Group 
Technical Monograph PRG-32(i) and PRG-32(ii)
1983

HEND84a *
Henderson P.
Specifications and Programs
FPN-5
Dept of Comp Sci, Univ. of Stirling
Paper presented at Centre for Software Reliability Workshop,
City University, April1984
to be published in "Software; Requirements, Specification and Testing"
(ed Dr. T. Anderson) pub. Blackwell Scientific Publications
July 1984

HEND84b
Henderson P.
Some Distributed Systems
FPN-6
Dept of Comp Sci, Univ. of stirling
July 1984

HEND84c *
Henderson P.
Process Combinators
FPN-7
Dept of Comp Sci, Univ of Stirling
August 1984

HEND84d *
Henderson P.
Communcating Functional Programs
FPN-8
Dept of Comp Sci, Univ of Stirling
September 1984

HEND84e *
Henderson P.
Me Too - A Language for Software Specification and Model Building -
Preliminary Report
FPN-9
First Draft : October 1984
Second Draft : December 1984
1984

HENN76a *
Hennessy M. & Ashcroft E.A.
The Semantics of Nondeterminism
Proceedings 3rd International Colloquium on Automata Languages and Programming
pp 478 - 493
Edinburgh University Press, 1976

HEWI73a
Hewitt C. et al.
Actor Induction and Meta-Evaluation
1st ACM Symposium on Principles of Programming Languages
1973

HEWI77a
Hewitt C.
Viewing Control Structures as Patterns of Passing Messages
AI Journal 8, no 3, pp 323-364, 1977

HEWI79a
Hewitt C.
Control Structure as Patterns of Passing Messages
Artificial Intelligence: An MIT Perspective ,The MIT Press p433-465 1979

HEWI80a *
Hewitt C.
The Apiary Network Architecture for Knowledgeable Systems
Proc. 1980 LISP Conf. p107-117

HIKI83a 
Hikita T.
Average Size of Turner's Translation to Combinator Program
ICOT research Center, Technical Report TR-017
August 1983

HINDI84a
Hindin Harvey J.
Fifth-Generation Computing: Dedicated Software is The Key
Computer Design, Sept 1984, page 150

HINDL69a
Hindley R.
The Principal Type Scheme of an Object in Combinatory Logic
Trans. American Mathematical Society 146, pp 29-60
1969

HINDL83a *
Hindley R.
The Completeness Theorem For Typing Lambda-Terms
Theoretical Computer Science 22, pp 1-17
North Holland
January 1983

HIRA83a 
Chart Parsing in Concurrent Prolog
ICOT research Center, Technical Report TR-007
May 1983

HOAR82a
Structure of an Operating System
in BROY82a, pp 643-658
1982

HOAR85a
eds. Hoare C.A.R. & Sheperdson J.C.
Mathematical Logic and Programming Languages
Prentice Hall International Series in Computer Science,
1985.
First published in the Philosophical Transactions of the Royal Society,
Series A, Volume 3/12, 1984.

HOAR85b
Hoare C.A.R.
Programs are Predicates
in HOA85a
1985

HOCK81a *
Hockney R.W. & Jesshope C.R.
Parallel Computers
Adam Hilger Ltd., Bristol
1981

HOFF82a *
Hoffmann C.M. & O'Donnell M.J.
Programming With Equations
ACM Transactions on Programming Languages and Systems, Vol 4, No 1
pp 83-112
January 1982

HOFF83a
Hoffmann C.M. & O'Donnell M.
Implementation of an interpreter for abstract equations
ACM Conference on Computer Science
1983

HOGG78a
Hogger C.J.
Program Synthesis in Predicate Logic
Proc. AISB/GI Conf. on Artif. Intell,
Hamburg, pp 18-20
1978

HOGG78b
Hogger C.J.
Goal Oriented Derivation of Logic Programs
Proc. MFCS Conf.,
Polish Acadamy of Sciences, Zakopane, pp 267-276
1978

HOGG81a
Hogger C.J.
Derivation of Logic Programs
J. Ass. Comput. Mach. 28, pp 372-422
1981

HOGG84a
Hogger C.J.
Introduction to Logic Programming
Academic Press
1984

HOLL80a
Holloway J. & Steele G.L.Jr. & Sussman G.J. & Bell A.
The Scheme-79 Chip
AI Memo 559, MIT Lab, Cambridge, 1980

HOLL80b
Holloway J. & Steel G. & Sussman G.J. & Bell A.
The Scheme 79 Chip
Proceedings LISP Conference, Stanford, 1980

HOLT86a *
Holt N.
Parallel Processing For Fifth Generation Systems
in BCS86a
1986

HOMM80a *
Hommes F. & Kluge W. & Schlutter H.
A Reduction Machine Architecture and Expression Oriented Editing
GMD ISF 80.04
1980

HOPK79a
Hopkins R.P. et al
A Computer Supporting Data Flow, Control Flow and Updatable Memory
Computing Laboratory, Univ of Newcastle upon Tyne
Tech Rep 144
1979

HORA85a *
Horacek H.
Semantic/Pragmatic Representation Language
Forschungsstelle fur Informationswissenschaft und Kunstiliche Intelligenz
Universitat Hamburg
LOKI Report NLI - 2.1
December 1985

HSIA83a *
Hsiang J. & Dershowitz N.
Rewrite Methods For Clausal and Non-Clausal Theorem Proving
10th EATCS International Colloquium on Automata, Languages and Programming
pp 331-346
1983

HSIA84a
Hsiao D.K.
Advanced Database Machine Architectures
Prentice Hall 1984

HUD81a
Hudak P.
Call-Graph Reclamation: An Alternative Storage Reclamation Scheme
AMPS Technical Memorandum #4
August 1981

HUD81b
Hudak P.
Real-Time Mark-Scan Garbage Collection on a Distributed Applicative
Processing System
AMPS Technical Memorandum #5
October 1981

HUD84a
Hudak P. & Kranz D.
A Combinator Based Compiler For a Functional Language
11th Symposium on Principles of Programming Languages
pp 122-132
1984

HUDA84b
Hudak P. & Keller R.M.
Garbage Collection and Task Deletion in Distributed Applicative
Processing System
Proc. Conf. on LISP and Functional Programming, ACM,
August 1984

HUDA84c *
Hudak P.
ALFL Reference Manual and Programmers Guide
Dept of Computer Science, University of Yale, Technical Report YALEU/DCS/TR-322
Second Edition
October 1984

HUDA84d *
Hudak P.
Distributed Applicative Processing Systems : Project Goals, Motivation,
and Status Report
Dept of Computer Science, University of Yale, Technical Report YALEU/DCS/TR-317
May 1, 1984

HUDA85a *
Hudak P. & Goldberg B.
Distributed Execution of Functional Programs Using Serial Combinators
IEEE Transactions on Computers, Vol c-34, no 10, pp 881-891
October 1985

HUDA85b *
Hudak P. & Guzman J.C.
A Proof-Stream Semantics for Lazy Narrowing
Dept of Computer Science, University of Yale, Research Report YALEU/DCS/RR-446
December 1985

HUDA85c *
Hudak P. & Young J.
Higher-Order Strictness Analysis in Untyped Lambda Calculus
Dept of Comp Sci, Univ of Yale
October 1985

HUDA85d *
Hudak P. & Smith L.
Para-Functional Programming: A Paradigm for Programming Multiprocessor Systems
Dept of Comp Sci, Univ of Yale
October 1985

HUDA85e *
Hudak P.
Functional Programming on Multiprocessor Architectures
Dept of Comp Sci, Univ of Yale, Research Report YALEU/DCS/RR-447
December 1985

HUET73a
Huet G.P.
The Undecidability of Unification in Third Order Logic
Information and Control 22, pp 257-267
1973

HUET75a
Huet G.P.
Unification in the Typed Lambda Calculus
Proc. Symposium on the Lambda Calculus and Computer Science Theory,
Springer Verlag, LNCS 37, pp 192-212
1975

HUET80a
Huet G.P. & Oppen D.
Equations and Rewrite Rules: a Survey
Report CSL-111, SRI International
1980

HUGH82a *
Hughes R.J.M.
Super-Combinators:a new Implementation Method for Applicative Languages
Proc. ACM Symposium on LISP and Functional Languages (Aug 1982) p1-10

HUGH82b *
Hughes R.J.M.
Graph Reduction with Super-Combinators
Oxford University Programming Research Group Technical Monograph PRG-28
June 1982

HUGH83a *
Hughes R.J.M.
The Design and Implementation of Programming languages
Oxford University Programming Research Group Technical Monograph PRG-40
(published as monograph september 84)
July 1983

HUGH84a *
Hughes R.J.M.
Reference Counting with Circular Structures in Virtual Memory Applicative 
Systems
Programming Research Group, Oxford University 1984

HUGH84b
Hughes R.J.M.
Parallel Functional Programs Use Less Space
Programming Research Group, Oxford University
1984

HUGH84c
Hughes G.E. & Cresswell M.J.
A Companion to Modal Logic
Methuen 1984

HUTC86a *
Hutchinson A.
A Data Structure and Algorithm for a Self-Augmenting Heuristic Program
Computer Journal, Vol 29, No 2, pp 135-150
April 1986

HWAN84a
Hwang K.
Computer Architecture and Parallel Processing
McGraw Hill 1984
-- 
Andy Cheese