Copy Link
Add to Bookmark
Report
AIList Digest Volume 4 Issue 101
AIList Digest Saturday, 26 Apr 1986 Volume 4 : Issue 101
Today's Topics:
Bibliography - References #1
----------------------------------------------------------------------
Date: 9 Apr 86 13:20:13 GMT
From: allegra!mit-eddie!think!harvard!seismo!mcvax!ukc!dcl-cs!nott-cs!
abc@ucbvax.berkeley.edu (Andy Cheese)
Subject: Bibliography - References #1
>From Andy Cheese, CS Department, Nottingham University, UK:
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
------------------------------
End of AIList Digest
********************
