leff@smu.CSNET (Laurence Leff) (12/07/87)
November 1987
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
July 1986 (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
No 27 The Complexity of a Translation
of Lambda-calculus to
Categorical Combinators
R D Lins
August 1987 (Revision 1)
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
April 1986 (Revision 1)
No 34 On the Efficiency of Categorical
Combinators as a Rewriting System
R D Lins
February 1987 (Revision 2)
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
No 38 Flex
An experience of Miranda
R E Jones
June 1986
No 39 Term - A Multiplexing Terminal
Emulator for the Atari ST
R P A Collinson
May 1987 (Revision 1)
No 40 Writing Interactive Programs
in Miranda
S J Thompson
July 1986
No 41 Categorical Multi-Combinators
R D Lins
June 1987 (Revision 2)
No 42 Simulating Digital Circuits in Miranda
S A Hill
February 1987 (Revision 1)
No 43 Connecting WIMPS together:
Interim Report #1
R J Faichney
March 1987
No 44 Type Checking "Miranda"
M Longley
April 1987
No 45 Towards Knowledge Bases -
Semantics, Rules and Object-oriented
Programming
E A Oxborrow
February 1987
No 46 Incremental Execution Environment
M A Bhatti
June 1987
No 47 Implementing SASL using
Categorical Multi-Combinators
R D Lins
September 1987
No 48 Interactive functional programs:
a method and a formal semantics
S J Thompson
November 1987
Theses are available for a charge of `6 to cover the cost of copying and
postage.
Requests for theses, to include cheques made payable to UNIKENT, should
be sent to:
Documentation Officer
Computing Laboratory
The University
Canterbury
Kent CT2 7NF
T1. On The Efficiency of Applicative Algorithms
Silvio Romero de Lemos Meira March 1985 Ph.D.
the overall theme of this Thesis is the efficiency of algorithms
written in purely applicative style. Now that applicative
languages are more of a reality than just theoretical toys, it was
felt it was time to analyse some of the issues that will arise from
their use at large.
T2. On The Efficiency of Categorical Combinators in Applicative Languages
Rafael Dueire Lins October 1986 Ph.D.
The works of Lambek and Scott proved that the theories of typed L-
Calculus and Cartesian Closed Categories are equivalent. This
inspired Curien to develop a system of combinators based on the
properties of Category Theory. This thesis analyses this system of
Categorical Combinators and presents several optimizations.
T3. Performance Modelling of Cambridge Ring Based Local Network
Wu Zheng-da February 1987 Ph.D.
This thesis is concerned with the development of performance model-
ling of local area networks and is especially concentrated on the
Cambridge Ring. The research work consists of three component
parts. Firstly, an analytic model is developed to evaluate the per-
formance of multiple Cambridge Rings. Secondly, a methodology is
presented for evaluating the end-to-end performance of a local area
network from a user point of view. Thirdly, a quantitative
analysis is presented for a performance comparison between two dif-
ferent network services.
November 1987