🚀 go-pugleaf

                    University of Kent at Canterbury

                      Computing Laboratory Reports

Reports are available free to academic institutions,  a  nominal  charge
will be made for reports requested by others.

Requests for reports should be sent to:

          Documentation Officer
          Computing Laboratory
          The University
          Canterbury
          Kent CT2 7NF


No 1   Transport Service Byte
       Stream Protocol (TSBSP)
       I N Dallas
       August 1981 (Revision 3)

No 2   UKC Papers on the
       Cambridge Ring presented
       at Networkshops 4, 5 & 6
       S E Binns, I N Dallas, M N A Lee
       October 1980

No 3   Operational Experiences with
       a Cambridge Ring Local Area
       Network in a University Environment
       E B Spratt
       October 1980

No 4   Multidimensional Search Trees
       as Indices of Files
       Y V Silva-Filho
       February 1981

No 5   Dynamic Program Building
       P J Brown
       December 1980

No 6   Byte Streams on a Microcomputer
       T E Schutt
       March 1981

No 7   Comments on style in C
       R P A Collinson
       May 1981

No 8   Cambridge Ring to PSS Gateway
       RSX-11M Transport Service
       Module (for X25) Specification
       I N Dallas
       June 1981

No 9   Basic Block Protocol
       Implementation Guide.
       I N Dallas
       March 1981

No 10  Protocols used on the Ring
       A Simple Guide
       I N Dallas
       March 1981

No 11  Executing Pascal and Assembly
       Language programs on the HEX-29
       R P Bird
       October 1981

No 12  UKC File Server
       M J Bayliss
       May 1982

No 13  The Kent Spooler for UNIX
       R P A Collinson
       June 1982

No 14  Sorting Algorithms in KRC
       Implemented in a Functional
       Programming System
       Silvio Lemos Meira
       August 1982

No 15  Fortran Subroutines for the
       Solution of Symmetric and
       Non-symmetric Toeplitz sets
       of Linear Equations using
       the Levinson-Trench Algorithm
       T R Hopkins
       October 1982

No 16  A UNIX SSP/BBP interface to
       the Cambridge Ring
       R P A Collinson
       December 1982

No 17  Unknotting Fortran
       T R Hopkins
       October 1983

No 18  The UKC TS29 Ring PAD
       A L Ibbetson
       June 1984 (Revision 2)

No 19  Implementing the Spectral Test
       for Assessing Linear Congruential
       Random Number Generators
       T R Hopkins
       March 1984

No 20  Optimized Combinatoric Code for
       Applicative Language Implementation
       Silvio Lemos Meira
       April 1984

No 21  The Proteus Distributed
       Database System
       E A Oxborrow
       July 1984

No 22  2-PIGS: An Interactive
       Graphical Programming Environment
       with Mixed Interpretation
       and Compilation
       Man-Chi Pong
       September 1984

No 23  Report on the Hewlett Packard
       4951A Protocol Analyser
       I N Dallas
       September 1984

No 24  Menus and Menu Systems
       An Approach to the User Interface
       James A Pitcairn-Hill
       October 1984

No 25  A Microcomputer Database System
       in a Distributed
       Database Environment
       E A Oxborrow
       October 1984

No 26  I-PIGS: A Concurrent Programming
       Environment with Interactive
       Graphical Support
       Man-Chi Pong
       November 1984

No 27  The Complexity of a Translation
       of L-calculus to
       Categorical Combinators
       R D Lins
       April 1985

No 28  A Linear Applicative Solution
       for The Set Union problem
       Silvio Lemos Meira
       May 1985

No 29  A Short Guide to LaTeX
       Silvio Lemos Meira
       May 1985

No 30  Proceedings of a Seminar on
       Social Science Computing Services
       11 January 1985
       The Economic & Social Research Council
       1 Temple Avenue London EC4
       R E Cooley
       July 1985

No 31  Computation with Graphics in a
       Mathematics Teaching Initiative
       G J Makinson and H L Morarji
       October 1985

No 32  KAS: A New Authoring System for
       Computer-Assisted Learning
       G J Makinson and H L Morarji
       October 1985

No 33  A New Formula for the Execution
       of Categorical Combinators
       R D Lins
       November 1985
       (Revision 1 - April 1986)

No 34  On the Efficiency of Categorical
       Combinators as a Rewriting System
       R D Lins
       November 1985
       (Revision 1 - May 1986)

No 35  Laws in Miranda
       S J Thompson
       December 1985

No 36  A Graph Reduction Machine
       for Execution of
       Categorical Combinators
       R D Lins
       April 1986

No 37  Proving properties of functions
       defined on lawful types
       S J Thompson
       May 1986

June 1986