BACKH84a *

Backhouse R.

Algorithm Development in Martin-Lof's Type Theory

CSM-69

Department of Computer Science, University of Essex

July 1984

BACKH84b *

Backhouse R.C.

A Note on Subtype in Martin-Lof's Theory of Types

CSM-70

Department of Computer Science, University of Essex

November 1984

BACKH84c *

Backhouse R.C.

The While-Rule in Martin-Lof's Theory of Types

CSM-71

Department of Computer Science, University of Essex

December 1984

BACKH85a *

Backhouse R.C.

Equality Rules in Type Theory

CSM-76

Department of Computer Science, University of Essex

April 1985

BACKH85b *

Backhouse R.C.

Notes on Martin-Lof's Theory of Types

Section 2

CSM-80

Department of Computer Science, University of Essex

December 1985

BACKH85c *

Backhouse R.C.

Notes on Martin-Lof's Theory of Types

Section 1 (Revised)

CSM-81

Department of Computer Science, University of Essex

February 1986

BACKU74a *

Backus J.

Programming Language Semantics and Closed Applicative Languages

ACM Symposium on Principles of Programming Languages, 1974

pp 71-86

1974

BACKU78a *

Backus J.

Can Programming be liberated from the von-Neumann Style?

CACM Vol 21 No 8 p613-641 Aug 1978

BACKU79a

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

BACKU81a

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

BADE86a *

Baden S.

Berkeley FP User's Manual, Rev. 4.1.

May 10, 1986

BAIL85a *

Bailey D.

Prolog for Real Programs

PS/48

University of Salford

5 pages

25 June 1985

BAIL86a *

Bailey D.

Catch and Throw - An Introduction

Salford University

PS/136

September 1986

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

BALB85a *

Balbin I. & Lecot K.

Logic Programming : A Classified Bibliography

Wildgrass Books Pty Ltd, Australia

ISBN 0 908069 15 4

1985

BALB86a *

Balbin I. & Ramamohanarao K.

A Differential Approach to Query Optimisation in Recursive Deductive

Databases

Department of Computer Science, University of Melbourne

Technical Report 86/7

to appear in Journal of Logic Programming

1986

BALL83a *

Ballieu G.

A Virtual Machine To Implement Prolog

Logic Programming Workshop '83

pp 40 - 52

26 June 1983

BAND86a *

Bandes R.G.

Constraining-Unification and the Programming Language Unicorn

in DEGR86a, pp 397-410

1986

BANDL83a *

Bandler W.

Some Esomathematical Uses Of Category Theory

Declarative Programming Workshop, University College London

pp 218-224

11-13th April 1983

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

BARBA86a *

Barbara D. & Garcia-Molina H.

Mutual Exclusion in Partitioned Distributed Systems

Distibuted Computing, Vol 1, No 2, pp 119-132

1986

BARBU84a *

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

BARBU86a *

Barbuti R. & Bellia M. & Levi G. & Martelli M.

LEAF : A Language Which Integrates Logic, Equations and Functions

in DEGR86a, pp 201-238

1986

BARE81a

Barendregt H.P.

The Lambda Calculus, Its Syntax and Semantics

North Holland 1981

BARE86a *

Barendregt H.P. & Kennaway JR. & Klop J.W. & Sleep M.R.

Needed Reduction and Spine Strategies for the Lambda Calculus

Centrum voor Wiskunde en Informatica. Amsterdam, The Netherlands

Centre for Mathematics and Computer Science

Computer Science / Department of Software Technology

Report CS-R8621

May 1986

BARE86b *

Barendregt H. & van Eekelen M.C.J.D. & Glauert J.R.W. & Kennaway J.R. &

Plasmeijer M.J. & Sleep M.R.

Term Graph Rewriting

October 20 1986

BARRE86a *

Barrett N.K. & Brailsford D.F. & Duckworth R.J.

A Simulator Program for Evaluating and Improving the Nottingham Muse

Architecture

Department of Computer Science, University of Nottingham

June 3, 1986

BARRI85a *

Barringer H.

Up and Down the Temp{*filter*}Way

Dept of Comp Sci, Univ of Manchester, Technical Report UMCS-85-9-3

September 4, 1985

BARRI86a *

Barringer H. & Mearns I.

A Proof System for Ada Tasks

Computer Journal, Vol 29, No 5, pp 404-415

October 1986

BCS86a *

British Computer Society Reading Branch Parallel Processing Seminar,

Proceedings

Tuesday 21st January 1986

BELLE86a *

Bellegarde F.

Rewriting Systems On FP Sequences To Reduce The Number Of Sequences Yielded

Science Of Computer Programming, 6, pp 11-34

January 1986

BELLI80a *

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

BELLI83a *

Bellia M. & Levi G. & Martelli M.

On Compiling Prolog Programs on Demand Driven Architectures

Proceedings of Logic Programming Workshop '83

Praia Da Falesia, Algarve, Portugal, pp 518-535

26 June - 1 July 1983

BEND80a *

Bendl J. & Koves P. & Szeredi P.

The MPROLOG System

Proceedings of "Logic Programming Workshop", Debrecen, Hungary,

14-16 July 1980

also in MPROLOG Collection of Papers on Logic Programming,

pp 201-209, November 1984

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

BERK85a *

Berkling K.

Epsilon-Reduction : Another View of Unification

IFIP TC-10 Working Conference on Fifth Generation Computer Architecture,

UMIST, Manchester

July 15-18 1985

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

BERZ86a *

Berzins V. & Gray M. & Naumann D.

Abstraction-Based Software Development

CACM, Vol 29, No 5, pp 402 - 415

May 1986

BETZ85a *

Betz D.

XLISP: An Experimental Object Oriented Language Version 1.4

January 1, 1985

BETZ86a *

Betz D.

XLISP conferencing in article on best of bix, pp 376-380

Byte, volume 11, number 3

March 1986

BEYN85a *

Benyon W.M. & Buckle J.F.

Computational Equivalence and Replaceability in Finite Algebras

Theory of Computation Report No 72

Department of Computer Science, University of Warwick

August 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

BIRD84b *

Bird R.S.

The Promotion and Accumulation Strategies in Transformational Programming

ACM Transactions on Programming Languages and Systems, Vol 6, No 4

pp 487-504

October 1984

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

BLOM86a *

Blomberg G.

S046 : Background Notes

Should Prolog have a Lisp-like Syntax ?

PS/149

September 1986

BOBR80a *

Bobrow D.G.

Managing Reentrant Structures Using Reference Counts

ACM Trans. on Programming Languages and Systems, 2, no 3, pp 269-273

1980

BOCC86a *

Bocca J. & Decker H. & Nicolas J.-M. & Vieille & Wallace M.

Some Steps Towards a DBMS Based KBMS

Proc. 10th World Computer Congress, IFIP, Dublin, Ireland

September 1986

BOCC86b *

Bocca J.

On the Evaluation Strategy of EDUCE

Proc 1986 ACM-SIGMOD International Conference on Management of Data,

Washington D.C., U.S.A.

May 1986

BOCK86a *

Bockmayr A.

Conditional Rewriting and Narrowing as a Theoretical Framework for

Logic-Functional Programming : A Survey

Interner Bericht NR. 10/86

Institut Fur Informatik I, Universitat Karlsruhe, West Germany

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

BOLE85a *

Boley H. & Kammermeier F.

LISPLOG: Momentaufnahmen einer LISP/PROLOG-Vereinheitlichung

MEMO SEKI-85-03

Fachbereich Informatik, Universitat Kaiserlautern

August 1985

BOOM86a *

Boom H.

Issues in Program Transformation

522 MAL-1

9th October 1986

BOOM?? *

Boom H.J.

A Multidomain Abstracto

524 MAL-3

BOOM?? *

Boom H.

Transformo Discussion

543 MAL-22

BORG84a *

Borgwardt P.

Parallel PROLOG Using Stack Segments On Shared Memory Multiprocessors

1984 Int. Symp. on Logic Programming, pp 2-11

6 February 1984

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

BORO85a *

Borovsky B.H. & Ilieva P.I.

A Reconfigurable Highly Parallel Architecture Based on Recirculative Network

IFIP TC-10 Working Conference on Fifth Generation Computer Architecture,

UMIST, Manchester

July 15-18 1985

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

BOUT?? *

Boute R.

The Beta Calculus : Variable Scoping and Formal (Structural) Transformation

in the Description of Systems with Bidirectional Information Flow

539 MAL-18

BOWE79a *

Bowen K.A.

Prolog

Proceedings of the Annual Conference of the ACM 1979

pp 14-23

1979

BOWE81a

Bowen D.L.

Implementation of Data Structures on a Data Flow Computer

PhD Thesis, Dept of Comp Sci, Univ. of Manchester, April 1981

BOWE81b *

Bowen K.A. & Kowalski R.A.

Amalgamating Language and Metalanguage in Logic Programming

Department of Computing, Imperial College, Research Report 81/30

June 1981

BOWE?? *

Bowen D.L. & Byrd L.M. & Clocksin W.F.

A Portable Prolog Compiler

D.A.I. Research Paper No. 195

Department of Artificial Intelligence, University of Edinburgh

also presented at the Logic Programming Workshop, Albufeira, Portugal,

June 27th - July 1st, 1983

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

BROD80a *

Broda K.

The Relation Between Semantic Tableaux And Resolution Theorem Provers

Research Report DOC 80/20

Department of Computing, Imperial College

October 1980

BROD81a

Broda K.

B.SC I Mathematics of Computing Lecture Notes

Department of Computing, Imperial College, Lecture Notes 81/13

January 1981

BROD84a

Broda K. & Gregory S.

PARLOG For Discrete Event Simulation

Proceedings of the 2nd International Logic Programming Conference, Uppsala

( ed Tarnlund S-A ), pp 301-312

July 1984

BROD84b *

Broda K. & Gregory S.

Parlog For Discrete Event Simulation

Department Of Computing, Imperial College

Research Report DOC 84/5

March 1984

BROD85a *

Broda K. & Gabbay D.M. & Kriwaczek F.

A Goal Directed Theorem Prover for Preicate Logic Based on

Conjunctions and Implications

Draft

Dept of Computing, Imperial College

May 1985

BROO84a

Brookes S.D.

Reasoning About Synchronous Systems

CMU-CS-84-145

Dept of Comp Sci, Carnegie-Mellon Univ.

March 1984

BROO86a *

Brookes G.R. & Manson G.A. & Thompson J.A.

Lattice and Ring Array Topologies Using Transputers

Computyer Communications, Vol 9, No 3, pp 121-125

June 1986

BROU79a

Brough D.R.

Loop Trapping in Logic Programs

Department of Computing, Imperial College, TOC 79/9

1979

BROU83a *

Brough D.R. & Walker A.

Some Practical Properties of Logic Programming Interpreters

Research Report 83/34

Department of Computing, Imperial College

December 1983

BROU84a *

Brough D.R. & Parfitt N.

An Expert System for the Ageing of a Domestic Animal

Research Report DoC 84/13

Department of Computing, Imperial College

April 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

BRUI72a *

Bruin N.G. De

Lambda-Calculus Notation With Nameless Dummies, a Tool for Automatic

Formula Manipulation

pp 381-392

Indag Math. 34

Proceedings of the Koninklijke Nederlandse Akademie Van Wetenschappen

Series A Mathematical Sciences, Volume 75

North Holland Publishing Company

1972

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

BRYA83a

Bryant R.

Proceedings of the Third Caltech Conference on Very Large Scale Integration

ISBN 0 914894 86 2

Blackwell Scientific Pubs.

1983

BRYA85a *

Bryant R.E.

Symbolic Verification of MOS Circuits

1985 Chapel Hill Conference on VLSI

pp 419-438

1985

BRYA86a *

Bryant R.

Tutorial Diagnosis Of Subtraction Errors

Research Report CS-96-09

Department of Computer Science, University of Waterloo

January 31 1986

BSI85a *

Draft Minutes of Prolog Standardization Meeting, 7 March 1985

PS/40

BSI85b *

How To Define a Language Using Prolog

PS/73

1985

BSI86a *

BSI Prolog Standardization

Papers From The Module Subcommittee

PS/102

1986

BSI86b *

Draft Minutes of Prolog Standardization Meeting 6th March 1986, BSI

PS/104

1986

BSI86c *

BSI Prolog Standard

Summary Of BIP Committee Work

PS/108

10 April 1986

BSI?? *

FILETAB For VME2900 (Declarative I/O - Model For Prolog?)

PS/111

BSI?? *

Can Users Define And Redefine Operators ?

Prolog Standardization Problem And Its Solution

S026

BSI?? *

How Do Users Define And Redefine Operators ?

Prolog Standardization Problem And Its Solution

S027

BSI?? *

Can Users Define And Redefine Functions ?

Prolog Standardization Problem And Its Solution

S028

BSI?? *

How Do Users Define And Redefine Functions ?

Prolog Standardization Problem And Its Solution

S029

BSI?? *

BSI Prolog Document PS/8-1

BSI86d *

Prolog Standard

Built-In Predicates (Logic, Sets, Debugging, Environment).

PS/105/1

J. W. Doores (ICL)

14 May 1986

BSI86e *

Agenda For Meeting At BSI, 5th June 1986

PS/114

BSI86f *

Minutes For Built-In Predicates Meeting, March 1986

PS/107

BSI?? *

AFNOR - Notes On Dif, Freeze, etc

PS/113

BSI86g *

Lazy Evaluation And Coroutining

S018

May 1986

BSI86h *

BSI PROLOG

Semantics Sub Group

Minutes of Meeting, May 6 1986

PS/119 Preprint

BSI?? *

Which Character Set Is Used For Standard Prolog ?

S030

BSI?? *

How Should Lists Be Represented In Standard Prolog ?

S031

BSI?? *

How Are Variables Represented In Standard Prolog ?

S032

BSI?? *

What Form Should Formatted I/O Take ?

S033

BSI86i *

Documents from AFNOR - F12, F13 and F14

PS/109

1986

BSI86j *

BSI Prolog, Semantics Sub-Group

Minutes of Meeting, May 6 1986

PS/119

1986

BSI86k *

Documents from AFNOR with Emphasis on Syntax - F15, F17

PS/120

1986

BSI86l *

BSI Prolog

Minutes of Built-In Predicates Sub-Group Meeting, 12th June 1986

PS/123

1986

BSI86m *

The Standardization of Prolog

Agenda for Meeting, 4th September 1986

PS/130

1986

BSI86n *

AFNOR Draft Proposition on Control Predicates

15 pages

PS/117

June 1986

BSI86o *

BSI Prolog - Semantics Sub Group

Minutes of Meeting July 8 1986

PS/126

1986

BSI86p *

Address List for BSI Prolog Standardization Panel

PS/122

September 1986

BSI86q *

Documents From AFNOR

PS/125

June/July 1986

BSI86r *

Draft Minutes of Meeting at BSI, 4th September 1986

PS/133

1986

BSI86s *

Modules in Prolog

Miscellaneous Papers

L.A. Wallen, M. Rubinstein, A.N. Davis & A. Schappo, M. Cutcher, D.S. Moffat

PS/116

June 1986

BSI86t *

BSI Prolog

Semantics Sub Group

Minutes of Meeting, September 30, 1986, held at System Designers Ltd

PS/155

1986

BSI86u *

Agenda for all day meeting on the standardization of prolog on 4th

December 1986

PS/157

1986

BSI86v *

Built-In Predicates Subcommittee

Minutes of Meeting 11 September 1986

PS/144

1986

BSI86w *

AFNOR Paers F22, F25 and F26 on Modules, Control Predicates and Minutes of

AFNOR Meeting (Sept 1986)

PS/147

October 1986

BSI?? *

Prolog Standardization Problem and its Solution

How Should Strings Be Handled ?

[S024-860310]

BSI?? *

Prolog Standardization Problem and its Solution

How Should Characters be Represented in Prolog ?

[S025-860310]

BSI ?? *

Prolog Standardization Problem and its Solution

What Editing Facilities Should Be Included in a Prolog Standard ?

[S011-850824]

BSI ?? *

Prolog Standardization Problem and its Solution

Comments in Prolog

[S012-850824]

BSI ?? *

Prolog Standardization Problem and its Solution

User-Defined Operators

[S013-850606]

BSI ?? *

Prolog Standardization Problem and its Solution

Where Can Arithmetic Expressions Be Evaluated ?

[S014-850606]

BSI ?? *

Prolog Standardization Problem and its Solution

Sophistication of Syntax

[S015-850606]

BSI ?? *

Prolog Standardization Problem and its Solution

The Meaning of "Cut"

[S016-850820]

BSI ?? *

Fread

DRAFT

Formatted I/O

P161

BSI ?? *

Fwrite

Formatted I/O

DRAFT

P162

BSI ?? *

Length

Formatted I/O

DRAFT

p163

BSI ?? *

Prolog Standardization Problem and its Solution

The Order of Characters

[S035-860701]

BSI ?? *

Prolog Standardization Problem and its Solution

Should Bagof and Setof be Resatisfiable ?

[S036-860826]

BSI ?? *

Prolog Standardization Problem and its Solution

Should Save/1 and Restore/1 be Included in the Standard ?

[S037-860701]

BSI ?? *

Prolog Standardization Problem and its Solution

Do We Need Database References ?

[S040-860826]

BSI ?? *

Prolog Standardization Problem and its Solution

Do We Need Internal Database Predicates ?

[S041-860701]

BSI ?? *

Prolog Standardization Problem and its Solution

In What Context are Expressions Evaluated ?

[S042-860826]

BSI ?? *

Prolog Standardization Problem and its Solution

Do Predicates Treated as Functions Evaluate Their Arguments ?

[S043-860826]

BSI ?? *

Prolog Standardization Problem and its Solution

What Tokenisation Primitives Do We Need ?

[S044-860826]

BSI ?? *

Prolog Standardization Problem and its Solution

Should Grammar Rules Be Part of Standard Prolog ?

[S045-860703]

BSI ?? *

Prolog Standardization Problem and its Solution

Should an Alternative (Common Lisp) Syntax be Standardized ?

[S046-860908]

BSI ?? *

Prolog Standardization Problem and its Solution

How Should '!' and not Interact ?

[S047-861024]

BUNDE85a *

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

BUNDE85b *

Bunder M.W.

Possible Forms Of Evaluation Or Reduction In Martin-Lof Type Theory

Theoretical Computer Science, 41, pp 113-120

1985

BUNDY85a *

Bundy A. & Sterling L.

Meta-Level Inference in Algebra

D.A.I. Research Paper No. 273

Department of Artificial Intelligence, University of Edinburgh

to be published in Proceedings of the Capri-85 Conference on A.I.,

North Holland

1985

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

BURK83a *

Burkimsher P.C.

PRISM: A DSM Multiprocessor Reduction Machine For The Parallel

Implementation Of Applicative Languages

Declarative Programming Workshop, University College London

pp 189-202

11-13th April 1983

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

also Internal Report CSR-101-82

Deparment of Computer Science, University of Edinburgh

February 1982

1982

BURS84a *

Burstall R.M.

Programming with Modules as Typed Functional Programming

Proc. Int. Conf. on Fifth Gen. Computing Systems, Tokyo

November 1984

BURS86a *

Burstall R.M. & Rydeheard D.

Computing with Categories

LFCS Report Series, ECS-LFCS-86-9

Laboratory for Foundations of Computer Science, Department of Computer

Science, University of Edinburgh

September 1986

BURS86b *

Burstall R.M.

Research in Interactive Theorem Proving at Edinburgh University

LFCS Report Series, ECS-LFCS-86-12

Laboratory for Foundations of Computer Science, Department of Computer

Science, University of Edinburgh

October 1986

BURT83a *

Burton F.W. & Huntbach M.M. & McKeown G.P. & Rayward-Smith V.J.

Parallelism in Branch-and-Bound Algorithms

Internal Report CSA/3/1983

Mathematical Algorithms Group - 2

School of Computing Studies and Accountancy, University of East Anglia

October 1983

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

BURT85b

Burt A.

A PARLOG Operating System

MSc Thesis, Dept of Computing, Imperial College

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

--

Andy Cheese