[1]
R. Morrison, A. Dearle, R. C. H. Connor, and A. L. Brown, ‘An Ad-Hoc Approach to the Implementation of Polymorphism’,
ACM Transactions on Programming Languages and Systems, vol. 13, no. 3, pp. 342–371, 1991. Published as
CS/90/1.
[2]
J. Rosenberg, J. L. Keedy, and D. A. Abramson, ‘Addressing Mechanisms for Large Virtual Memories’, The Computer Journal, vol. 35, no. 4, pp. 369–375, 1992. Published as CS/90/2.
[3]
A. Albano, A. L. Brown, A. Dearle, R. C. H. Connor, L. Fegaras, G. Ghelli, R. Hull, C. D. Marlin, F. Matthes, R. Morrison, R. Orsini, J. W. Schmidt, T. Sheard, and D. Stemple, ‘Type Systems and Database Programming Languages’, 1990. Published as CS/90/3.
[4]
J. Rosenberg, F. Henskens, A. L. Brown, R. Morrison, and D. Munro, ‘Stability in a Persistent Store Based on a Large Virtual Memory’, J Rosenberg and J L Keedy, Eds, Springer-Verlag, 1990, pp. 229–245. Published as
CS/90/6.
[5]
R. Morrison, A. L. Brown, R. C. H. Connor, Q. I. Cutts, G. Kirby, A. Dearle, J. Rosenberg, and D. Stemple, ‘Protection in Persistent Object Systems’, in Security and Persistence. 1990, pp. 48–66. Published as
CS/90/7.
[6]
A. L. Brown, A. Dearle, R. Morrison, D. Munro, and J. Rosenberg, ‘A Layered Persistent Architecture for Napier88’, J Rosenberg and J L Keedy, Eds, Springer-Verlag, 1990, pp. 155–172. Published as
CS/90/8.
[7]
F. A. Henskens, J. Rosenberg, and M. R. Hannaford, ‘Stability in a Network of MONADS-PC Computers’, J Rosenberg and J L Keedy, Eds, Springer-Verlag, 1990, pp. 246–256. Published as CS/90/9.
[8]
M. K. Weir, ‘A Method for Self-Determination of Adaptive Learning Rates in Back-Propagation’, 1990. Published as CS/90/10.
[9]
M. J. Livesey, ‘Distributed Varimistic Concurrency Control in a Persistent Object Store’, Alan Dearle, G Shaw, and S B Zdonik, Eds, Morgan Kauffman, 1990, pp. 293–304. Published as CS/90/11.
[10]
M. K. Weir and L. H. Chen, ‘Training and Generalisation Using Continuous Back-Propagation’, 1990. Published as CS/90/12.
[11]
M. J. Livesey, ‘Clamping in Boltzmann Machines’, 1990. Published as CS/90/13.
[12]
A. J. T. Davie and D. J. McNally, ‘Statically Typed Applicative Persistent Language Environment (STAPLE) Users’ Manual’, 1990. Published as CS/90/14.
[13]
A. L. Brown and J. Rosenberg, ‘Persistent Object Stores: An Implementation Technique’, Alan Dearle, G M Shaw, and S B Zdonik, Eds, Morgan Kaufmann, 1990, pp. 199–212. Published as CS/90/15.
[14]
G. Kirby and A. Dearle, ‘An Adaptive Graphical Browser for Napier88’, 1990. Published as
CS/90/16.
[15]
Q. I. Cutts, A. Dearle, and G. Kirby, ‘WIN Programmers’ Manual’, 1990. Published as CS/90/17.
[16]
M. J. Livesey, ‘A Network Model of Barrier Synchronisation Algorithms’, 1990. Published as CS/90/18.
[17]
A. J. T. Davie and D. J. McNally, ‘CASE - A Lazy Version of an SECD Machine with a Flat Environment’, 1988. Published as CS/90/19.
[18]
D. J. McNally and A. J. T. Davie, ‘Two Models for Integrating Persistence and Lazy Functional Languages’, 1991. Published as CS/91/1.
[19]
A. L. Brown and R. Morrison, ‘A Generic Persistent Object Store’,
Software Engineering Journal, vol. 7, no. 2, pp. 161–168, 1992. Published as
CS/91/2.
[20]
R. C. H. Connor, ‘Types and Polymorphism in Persistent Programming Systems’, University of St Andrews, 1990. Published as
CS/91/3.
[21]
M. J. Livesey, C. Allison, and P. Burgess, ‘A Development Environment and Testbed for Embedded Transputer Systems’, 1991. Published as CS/91/4.
[22]
R. Dyckhoff, ‘Contraction-Free Sequent Calculi for Intuitionistic Logic’, Journal of Symbolic Logic, vol. 57, pp. 795–807, 1992. Published as CS/91/5.
[23]
R. C. H. Connor, A. L. Brown, Q. I. Cutts, A. Dearle, R. Morrison, and J. Rosenberg, ‘Type Equivalence Checking in Persistent Object Systems’, Martha’s Vineyard, USA: Morgan Kaufmann, 1990, pp. 151–164. Published as
CS/91/6.
[24]
R. C. H. Connor, D. J. McNally, and R. Morrison, ‘Subtyping and Assignment in Database Programming Languages’, in 3rd International Workshop on Database Programming Languages. 1991, pp. 363–382. Published as
CS/91/7.
[25]
G. Kirby, ‘Persistent Programming with Strongly Typed Linguistic Reflection’, in 25th Hawaii International Conference on System Sciences. Jan. 1992. Published as
CS/91/8.
[26]
A. L. Brown, G. Mainetto, F. Matthes, R. Mueller, and D. J. McNally, ‘An Open System Architecture for a Persistent Object Store’, in 25th Hawaii International Conference on System Sciences. Jan. 1992, pp. 766–776. Published as CS/91/9.
[27]
R. C. H. Connor and R. Morrison, ‘Subtyping Without Tears’, in 15th Australian Computer Science Conference. 1992, pp. 209–225. Published as
CS/91/10.
[28]
D. Stemple and R. Morrison, ‘Specifying Flexible Concurrency Control Schemes: An Abstract Operational Approach’, 1992, pp. 873–891. Published as
CS/91/11.
[29]
M. J. Livesey and C. Allison, ‘A General Purpose Time Warp Toolkit’, 1992. Published as CS/92/1.
[30]
G. Ostheimer, ‘Parallel Functional Computation on STAR:DUST’, 1992. Published as CS/92/2.
[31]
P. Burgess, M. J. Livesey, and C. Allison, ‘An Event Based Programming Model and Harness for Embedded Transputer Systems Development’, 1992. Published as CS/92/3.
[32]
M. J. Livesey and C. Allison, ‘Operating System Level Support for Coherence in Distributed Object Systems’, in IEEE Press. Sept. 1992, pp. 92–95. Published as CS/92/4.
[33]
A. L. Brown, A. J. T. Davie, and D. J. McNally, ‘An Integrated Model for Persistent Lazy Functional Programming’, 1992. Published as CS/92/5.
[34]
D. Stemple, R. B. Stanton, T. Sheard, P. Philbrow, R. Morrison, G. Kirby, L. Fegaras, R. L. Cooper, R. C. H. Connor, M. P. Atkinson, and S. Alagic, ‘Type-Safe Linguistic Reflection: A Generator Technology’, 1992. Published as
CS/92/6.
[35]
A. J. T. Davie and D. J. McNally, ‘PCASE - A Persistent Lazy Version of an SECD Machine’, 1992. Published as CS/92/7.
[36]
Paterson, N R and A. J. T. Davie, ‘An Initial Specification of Data Structures and Functions in the St Andrews Haskell Compiler’, 1992. Published as CS/92/8.
[37]
G. Kirby, R. C. H. Connor, Q. I. Cutts, A. Dearle, A. M. Farkas, and R. Morrison, ‘Persistent Hyper-Programs’, presented at the 5th International Workshop on Persistent Object Systems (POS5), San Miniato, Italy, 1992, pp. 86–106. Published as
CS/92/9.
[38]
A. M. Farkas, A. Dearle, G. Kirby, Q. I. Cutts, R. Morrison, and R. C. H. Connor, ‘Persistent Program Construction through Browsing and User Gesture with some Typing’, presented at the 5th International Workshop on Persistent Object Systems (POS5), San Miniato, Italy, 1992, pp. 376–393. Published as
CS/92/10.
[39]
R. Morrison, A. England, R. C. H. Connor, M. P. Atkinson, S. Barneva, F. Rabitti, and P. Zezula, ‘Using Continued Fractions for Dynamic Subtype Checking in Name Equivalence Single Inheritance Object-Oriented Databases’, 1992. Published as CS/92/11.
[40]
R. Morrison, R. C. H. Connor, Q. I. Cutts, G. Kirby, and D. Stemple, ‘Mechanisms for Controlling Evolution in Persistent Object Systems’,
Journal of Microprocessors and Microprogramming, vol. 17, no. 3, pp. 173–181, 1993. Published as
CS/92/12.
[41]
A. Dearle, Q. I. Cutts, and R. C. H. Connor, ‘An Application Architecture using Type-Safe Incremental Linking’, 1992. Published as CS/92/13.
[42]
M. J. Livesey and M. Moses, ‘Serialisability in Distributed Multiprocessors’, 1992. Published as CS/92/14.
[43]
M. J. Livesey and M. Moses, ‘Strict Serialisability is NP-Complete’, 1992. Published as CS/92/15.
[44]
M. J. Livesey and M. Moses, ‘A Note on Serialisability and Integrity Constraints in Databases’, 1992. Published as CS/92/16.
[45]
U. Martin and E. Scott, ‘The Order Types of Termination Orderings on Terms, Strings and Multisets’, 1993. Published as CS/92/17.
[46]
P. Burgess and M. J. Livesey, ‘Automated Conversion of Structure Types in a Heap’, 1993. Published as CS/93/1.
[47]
E. Scott, ‘Weights for Total Division Orderings on Strings’, 1993. Published as CS/93/2.
[48]
G. Kirby, ‘Reflection and Hyper-Programming in Persistent Programming Systems’, PhD, University of St Andrews, 1992. Published as
CS/93/3.
[49]
Q. I. Cutts, ‘Delivering the Benefits of Persistence to System Construction and Execution’, University of St Andrews, 1992. Published as
CS/93/4.
[50]
G. Kirby, Q. I. Cutts, R. C. H. Connor, and R. Morrison, ‘The Implementation of a Hyper-Programming System’, 1993. Published as
CS/93/5.
[51]
D. Stemple, R. Morrison, G. Kirby, and R. C. H. Connor, ‘Integrating Reflection, Strong Typing and Static Checking’, 1993, pp. 83–92. Published as
CS/93/6.
[52]
U. Martin, ‘Linear Interpretations by Counting Patterns’, in Lecture Notes in Computer Science. Montreal, 1993. Published as CS/93/7.
[53]
G. Ostheimer, ‘Parallel Functional Programming for Message-Passing Multiprocessors’, University of St Andrews, 1993. Published as CS/93/8.
[54]
D. McNally, ‘Models for Persistence in Lazy Functional Programming Systems’, University of St Andrews, 1993. Published as CS/93/9.
[55]
R. Morrison, C. Baker, R. C. H. Connor, Q. I. Cutts, and G. Kirby, ‘Approaching Integration in Software Environments’, 1993. Published as
CS/93/10.
[56]
M. J. Livesey, ‘A Note on Consistency in Asynchronous Multicaches’, 1993. Published as CS/93/11.
[57]
M. K. Weir and G. Polhill, ‘A Neural Implementation of Mitchell’s Concept and Version Spaces Technique’, University of St Andrews, 1993. Published as CS/93/12.
[58]
G. Ostheimer and A. J. T. Davie, ‘π-Calculus Characterizations of Some Practical λ-Calculus Reduction Strategies’, 1993. Published as CS/93/14.
[59]
R. Morrison, A. L. Brown, R. C. H. Connor, Q. I. Cutts, A. Dearle, G. Kirby, and D. S. Munro, ‘The Napier88 Reference Manual (Release 2.0)’, 1993. Published as CS/93/15.
[60]
L. Pinto, ‘Cut Formulae and Logic Programming’, in Extensions of Logic Programming, vol. 798, R Dyckhoff, Ed., in Lecture Notes in Artificial Intelligence, xvol. 798. , Springer-Verlag, 1994, pp. 282–300. Published as CS/93/16.
[61]
D. S. Munro, ‘On the Integration of Concurrency, Distribution and Persistence’, PhD, University of St Andrews, 1993. Published as
CS/94/1.
[62]
M. J. Livesey and C. Allison, ‘A Dynamically Configurable Co-processor for Microkernels’, 1994. Published as CS/94/2.
[63]
U. Martin and M. Thomas, ‘Verification Techniques for LOTOS’, vol. 873, in Lecture Notes in Computer Science, xvol. 873. , Springer-Verlag, 1994. Published as CS/94/3.
[64]
U. Martin, ‘Verification Techniques for LOTOS [ISO:8807] Specifications (Final Report)’, Springer-Verlag, 1994. Published as CS/94/4.
[65]
U. Martin and Scott, E A, ‘Solving Ordering Constraints for Strings’, 1994. Published as CS/94/5.
[66]
U. Martin, ‘On the Diversity of Orderings on Strings’, Fundamentae Informaticae, vol. 24, pp. 25–46, 1995. Published as CS/94/6.
[67]
G. Kirby, A. L. Brown, R. C. H. Connor, Q. I. Cutts, A. Dearle, V. S. Moore, R. Morrison, and D. S. Munro, ‘The Napier88 Standard Library Reference Manual (Version 2.2)’, 1994. Published as
CS/94/7.
[68]
R. Morrison, A. L. Brown, R. C. H. Connor, Q. I. Cutts, A. Dearle, G. Kirby, and D. S. Munro, ‘The Napier88 Reference Manual (Release 2.0)’, 1994. Published as
CS/94/8.
[69]
P. Burgess, ‘A Testbed for Embedded Systems’, University of St Andrews, 1994. Published as CS/94/9.
[70]
M. K. Weir and G. Polhill, ‘Implementing Mitchell’s Concept and Version Spaces Technique in Neural Networks using Weight Space Angle as the Partial Order Analogue’, University of St Andrews, 1994. Published as CS/94/10.
[71]
G. Ostheimer and A. J. T. Davie, ‘Load Bounding for Implicit Parallelism’, 1994. Published as CS/94/11.
[72]
P. Burgess, ‘Testbed v1.1 User Guide and Reference’, 1994. Published as CS/94/12.
[73]
P. Burgess, M. J. Livesey, and C. Allison, ‘Background Debugging for Embedded Systems - A Case Study’, 1994. Published as CS/94/13.
[74]
S. A. Linton and D. D. Shand, ‘Some Group Theoretic Examples with Completion Theorem Provers’, Journal of Automated Reasoning, vol. 17, no. 2, pp. 145–169, 1996. Published as CS/94/14.
[75]
U. Martin, ‘Termination Invariants for String Rewriting Systems’, 1994. Published as CS/94/15.
[76]
S. J. G. Scheuerl, R. C. H. Connor, R. Morrison, J. E. B. Moss, and D. S. Munro, ‘MaStA - An I/O Cost Model for Database Crash Recovery Mechanisms’, 1995. Published as
CS/95/1.
[77]
S. Brock and G. Ostheimer, ‘Process Semantics of Graph Reduction’, 1995. Published as CS/95/2.
[78]
N. Paterson, ‘Implementation of the Programming Language Haskell’, MSc, University of St Andrews, 1994. Published as CS/95/3.
[79]
S. J. G. Scheuerl, R. C. H. Connor, R. Morrison, J. E. B. Moss, and D. S. Munro, ‘The MaStA I/O Trace Format’, 1995. Published as
CS/95/4.
[80]
S. van Willigenburg, ‘The p-modular Descent Algebras of the Hyperoctahedral Group and Dihedral Group’, 1996. Published as CS/96/1.
[81]
M. D. Atkinson and S. van Willigenburg, ‘The p-modular Descent Algebra of the Symmetric Group’, Bulletin of the London Mathematical Society, vol. 29, pp. 407–414, 1997. Published as CS/96/2.
[82]
U. Martin, ‘Theorem Proving with Group Presentations: Examples and Questions’, in Lecture Notes in Computer Science, xvol. 1102. 1996. Published as CS/96/3.
[83]
U. Martin, ‘New Directions for Syntactic Termination Orderings’, Progress in Computer Science and Applied Logic, vol. 15, pp. 209–224, 1998. Published as CS/96/4.
[84]
A. A. Adams, ‘Meta-Theory in the Higher-Order Logic Framework Isabelle’, 1996. Published as CS/96/5.
[85]
M. D. Atkinson and D. Tulley, ‘Bounded Capacity Priority Queues’, Theoretical Computer Science, vol. 182, pp. 145–157, 1997. Published as CS/96/6.
[86]
M. D. Atkinson, M. J. Livesey, and D. Tulley, ‘Permutations Generated by Token Passing in Graphs’, Theoretical Computer Science, vol. 178, no. 1–2, pp. 103–118, 1997. Published as CS/96/7.
[87]
R. Dyckhoff and L. Pinto, ‘Implementation of a Loop-Free Method for Construction of Counter-Models for Intuitionistic Propositional Logic’, 1996. Published as CS/96/8.
[88]
R. Dyckhoff and L. Pinto, ‘A Permutation-Free Sequent Calculus for Intuitionistic Logic’, 1996. Published as CS/96/9.
[89]
G. Kirby, R. C. H. Connor, R. Morrison, and D. Stemple, ‘Using Reflection to Support Type-Safe Evolution in Persistent Systems’, 1996. Published as
CS/96/10.
[90]
S. A. Linton, Martin, U, Pröhle, P, and Shand, D D, ‘On Group Theory and Theorem Proving’, 1996. Published as CS/96/11.
[91]
J. Howe, ‘Theorem-Proving and Partial Proof Search for Intuitionistic Propositional Logic Using a Permutation-Free Calculus with Loop-Checking’, 1996. Published as CS/96/12.
[92]
A. A. Adams, ‘Meta-Theory of Sequent-Style Calculi in Coq’, 1996. Published as CS/97/1.
[93]
M. D. Atkinson, U. Martin, and E. F. Robertson, ‘Algebraic Applications of Automated Reasoning Techniques’, 1997. Published as CS/97/2.
[94]
D. D. Shand, ‘Proof Diagrams and Term Rewriting with Applications to Computational Algebra’, University of St Andrews, 1997. Published as CS/97/3.
[95]
G. Kirby, R. C. H. Connor, Q. I. Cutts, R. Morrison, D. S. Munro, and S. Scheuerl, ‘Flask: An Architecture Supporting Concurrent Distributed Persistent Applications’, 1997. Published as
CS/97/4.
[96]
G. Kirby, R. Morrison, R. C. H. Connor, and S. B. Zdonik, ‘Evolving Database Systems: A Persistent View’, 1997. Published as
CS/97/5.
[97]
G. Kirby and R. Morrison, ‘Orthogonal Persistence as an Implementation Platform for Software Development Environments’, 1997. Published as
CS/97/6.
[98]
R. Dyckhoff and L. Pinto, ‘Permutability of Proofs in Intuitionistic Sequent Calculi’, 1997. Published as CS/97/7.
[99]
R. Dyckhoff, ‘Dragalin’s Proofs of Cut-Admissibility for the Intuitionistic Sequent Calculi G3i and G3i’’, 1997. Published as CS/97/8.
[100]
S. van Willigenberg, ‘The Descent Algebras of Coxeter Groups’, PhD, University of St Andrews, 1998. Published as CS/97/9.
[101]
J. Howe, ‘A Permutation-Free Sequent Calculus for Lax Logic’, 1998. Published as CS/98/1.
[102]
D. D. Shand, ‘Proof Diagrams and Computer Generated Proofs’, University of St Andrews, 1998. Published as CS/98/2.
[103]
Weir, M K, ‘Generalisation for Fisher’s Iris Problem using Neural BiDirectional Convergence’, University of St Andrews, 1998. Published as CS/98/3.
[104]
Weir, M K, ‘A Comparison of Back-Propagation and Conjugate Gradient Descent for Neural BiDirectional Convergence’, University of St Andrews, 1998. Published as CS/98/4.
[105]
N. Cropper and U. Martin, ‘The Classification of Polynomial Orderings on Monadic Terms’, 1998. Published as CS/98/5.
[106]
U. Martin and D. D. Shand, ‘Invariants, Patterns and Weights for Ordering Terms’, Journal of Symbolic Computation, vol. 29, no. 6, pp. 921–957, 2000. Published as CS/98/6.
[107]
U. Martin, ‘Computers, Reasoning and Mathematical Practice’, 1997. Published as CS/98/7.
[108]
J. Howe, ‘Proof Search Issues in Some Non-Classical Logics’, PhD, University of St Andrews, 1998. Published as CS/99/1.
[109]
Cutting, A and Solomon, A, ‘Automaton Semigroups: Some Remarks and an Application’, 1999. Published as CS/99/2.
[110]
A. A. Adams, H. Gottliebsen, S. A. Linton, and U. Martin, ‘A Verifiable Lookup Table for Symbolic Definite Integrals’, 1999. Published as CS/99/3.
[111]
S. Negri, ‘Conservativity of Apartness Over Equality, Revisited’, 1999. Published as CS/99/4.
[112]
R. Dyckhoff, ‘Automated Reasoning with Analytic Tableaux and Related Methods’, 2000. Published as CS/00/1.
[113]
E. Zirintsis, ‘Towards Simplification of the Software Development Process: The Hyper-Code Abstraction’, PhD, University of St Andrews, 2000. Published as
CS/00/2.
[114]
A. Dearle, G. Kirby, R. Morrison, K. Mullen, Y. Yang, R. C. H. Connor, P. Welen, and A. Wilson, ‘A Recursive Software Architecture for Location-Aware Services’, 2002. Published as
CS/02/1.
[115]
E. Zirintsis, G. Kirby, A. Dearle, and R. Morrison, ‘Report on the XBase Project’, 2003. Published as
CS/03/1.
[116]
G. Kirby, E. Zirintsis, A. Dearle, and R. Morrison, ‘A Generic Storage API’, 2003. Published as
CS/03/2.
[117]
R. Morrison, G. Kirby, D. Balasubramaniam, K. Mickan, F. Oquendo, S. Cîmpan, B. C. Warboys, B. Snowdon, and R. M. Greenwood, ‘Constructing Active Architectures in the ArchWare ADL’, 2003. Published as
CS/03/3.
[118]
A. Dearle, G. Kirby, and A. J. McCarthy, ‘A Framework for Constraint-Based Deployment and Autonomic Management of Distributed Applications’, 2004. Published as
CS/04/1.
[119]
A. Dearle, G. Kirby, and A. J. McCarthy, ‘A Middleware Framework for Constraint-Based Deployment and Autonomic Management of Distributed Applications’, 2004. Published as
CS/04/2.
[120]
S. M. Walker, A. Dearle, G. Kirby, and S. J. Norcross, ‘Exposing Application Components as Web Services’, 2004. Published as
CS/04/3.
[121]
S. M. Walker, A. Dearle, G. Kirby, and S. J. Norcross, ‘Promoting Component Reuse by Separating Transmission Policy from Implementation’, 2005. Published as
CS/05/1.
[122]
S. Walker, A. Dearle, S. J. Norcross, G. Kirby, and A. J. McCarthy, ‘RAFDA: Middleware Supporting the Separation of Application Logic from Distribution Policy’, 2005. Published as
CS/05/3.
[123]
S. M. Walker, ‘RAFDA Run-Time (RRT) Beginner’s Guide v1.0’, 2005. Published as
CS/05/4.
[124]
S. M. Walker, ‘Performing Automatic Application Transformation using the RAFDA Tools’, 2005. Published as
CS/05/5.
[125]
A. Dearle, G. Kirby, S. J. Norcross, and A. J. McCarthy, ‘A Peer-to-Peer Middleware Framework for Resilient Persistent Programming’, 2006. Published as
CS/06/1.
[126]
S. M. Walker, A. Dearle, S. J. Norcross, G. Kirby, and A. J. McCarthy, ‘RAFDA: A Policy-Aware Middleware Supporting the Flexible Separation of Application Logic from Distribution’, 2006. Published as
CS/06/2.
[127]
A. Dearle, G. Kirby, S. J. Norcross, A. D. Macdonald, and G. J. Bigwood, ‘Towards Adaptable and Adaptive Policy-Free Middleware’, 2006. Published as
CS/06/3.
[128]
A. Dearle, G. Kirby, and S. J. Norcross, ‘Hosting Byzantine Fault Tolerant Services on a Chord Ring’, 2007. Published as
CS/07/1.