%A Andrew M. Lister %T Inter-process communcation mechnaisms %R Technical Report No. 4 %I Department of Computer Science, University of Queensland %D December 1977 %P 36 %K tutorial, concurrent processing, operating systems, mutual exclusion resource scheduling, synchronisation, structured multiprocessing %A Paul A.C. Bailes %A Larry H. Reeker %T The Post-X programming language %R Technical Report No. 12 %I Department of Computer Science, University of Queensland %D February 1980 %P 37 %K applicative programming, string processing %A John Staples %T A new technique for analysing parameter passing, applied to the lambda calculus %R Technical Report No. 24 %I Department of Computer Science, University of Queensland %D February 1981 %P 17 %K variable renaming %A John Staples %T Efficient lazy evaluation of lambda expressions: a stack-based approach %R Technical Report No. 26 %I Department of Computer Science, University of Queensland %D March 1981 %P 27 %K optimal evaluation algorithm %A Ross Paterson %A John Staples %T An algebra of processes with a finite basis %R Technical Report No. 29 %I Department of Computer Science, University of Queensland %D June 1981 %P 8 %K communicating processes, ports, traces %A Peter Eades %A Michael Hickey %A Ronald Read %T Some Hamiltonian paths and a minimal change algorithm %R Technical Report No. 31 %I Department of Computer Science, University of Queensland %D January 1981 %P 34 %K combinatorial algorithms, graphs %A Paul A. C. Bailes %T An introduction to Post-X by examples %R Technical Report No. 32 %I Department of Computer Science, University of Queensland %D August 1981 %P 9 %K applicative programming, string processing, data abstraction %A Ross Paterson %T Universal objects and denotational semantics %R Technical Report No. 33 %I Department of Computer Science, University of Queensland %D December 1981 %P 21 %K category theory, approaches to semantics, algebraic methods %A H. Ehrig %A John Staples %T Church-Rosser properties for graph replacement systems with unique splitting %R Technical Report No. 36 %I Department of Computer Science, University of Queensland %D April 1982 %P 32 %K graph grammars, lambda calculus %A John Staples %A Van L. Nguyen %T Computing the behaviour of nondeterministic processes %R Technical Report No. 39 %I Department of Computer Science, University of Queensland %D April 1982 %P 18 %K models of communicating processes, ports, networks %A Kerry A. Raymond %T A distributed cookbook %R Technical Report No. 40 %I Department of Computer Science, University of Queensland %D February 1983 %K ZZ1025 CSP Ada DP PLITS communication %A A. Burns %A Andrew M. Lister %A A. J. Wellings %T A review of Ada tasking %R Technical Report No. 63 %I Department of Computer Science, University of Queensland %D November 1985 %K survey, concurrency %O (also published by University of Bradford and University of York)