Heuristic and decision tree methods on computers : some operational research applications. - Rodney Martineau Burstall (1965)

Book Review: Computer and Information Sciences, by J. T. Tou and R. H. Wilcox, 1965; 544 pages. - Rod M. Burstall (Comput. J., 1966)

Computer Design of Electricity Supply Networks by a Heuristic Method. - Rod M. Burstall (Comput. J., 1966)

Automation Theory and Learning Systems. - Rod M. Burstall (Comput. J., 1968)

Proving Properties of Programs by Structural Induction. - Rod M. Burstall (Comput. J., 1969)

A Program for Solving Word Sum Puzzles. - Rod M. Burstall (Comput. J., 1969)

An algebraic description of programs with assertions, verification and simulation. - Rod M. Burstall (Proving Assertions About Programs, 1972)

A Versatile Computer-Controlled Assembly System. - A. Patricia Ambler; Harry G. Barrow; Christopher M. Brown; Rod M. Burstall; Robin J. Popplestone (IJCAI, 1973)

The algebraic theory of recursive program schemes. - Rod M. Burstall; James W. Thatcher (Category Theory Applied to Computation and Control, 1974)

Program Proving as Hand Simulation with a Little Induction. - Rod M. Burstall (IFIP Congress, 1974)

Some transformations for developing recursive programs. - Rod M. Burstall; John Darlington (Reliable Software, 1975)

A Versatile System for Computer-Controlled Assembly. - A. Patricia Ambler; Harry G. Barrow; Christopher M. Brown; Rod M. Burstall; Robin J. Popplestone (Artif. Intell., 1975)

A System which Automatically Improves Programs. - John Darlington; Rod M. Burstall (Acta Informatica, 1976)

Subgraph Isomorphism, Matching Relational Structures and Maximal Cliques. - Harry G. Barrow; Rod M. Burstall (Inf. Process. Lett., 1976)

Putting Theories Together to Make Specifications. - Rod M. Burstall; Joseph A. Goguen (IJCAI, 1977)

A Transformation System for Developing Recursive Programs. - Rod M. Burstall; John Darlington (J. ACM, 1977)

The Semantics of CLEAR, A Specification Language. - Rod M. Burstall; Joseph A. Goguen (Abstract Software Specifications, 1979)

HOPE: An Experimental Applicative Language. - Rod M. Burstall; David B. MacQueen; Donald Sannella (LISP Conference, 1980)

Electronic Category Theory. - Rod M. Burstall (MFCS, 1980)

Making Programs more Readable. - J. L. Weiner; Rod M. Burstall (Symposium on Programming, 1980)

Deriving very Efficient Algorithms for Evaluating Linear Recurrence Relations Using the Program Transformation Technique. - Alberto Pettorossi; Rod M. Burstall (Acta Informatica, 1982)

Structured Theories in LCF. - Donald Sannella; Rod M. Burstall (CAAP, 1983)

Introducing Institutions. - Joseph A. Goguen; Rod M. Burstall (Logic of Programs, 1983)

Programming with Modules as Typed Functional Programming. - Rod M. Burstall (FGCS, 1984)

A Kernel Language for Abstract Data Types and Modules. - Rod M. Burstall; Butler W. Lampson (Semantics of Data Types, 1984)

Some Fundamental Algebraic Tools for the Semantics of Computation. Part 1: Comma Categories, Colimits, Signatures and Theories. - Joseph A. Goguen; Rod M. Burstall (Theor. Comput. Sci., 1984)

Some Fundamental Algebraic Tools for the Semantics of Computation. Part II: Signed and Abstract Theories. - Joseph A. Goguen; Rod M. Burstall (Theor. Comput. Sci., 1984)

A Study in the Functions of Programming Methodology: Specifications, Institutions, Charters and Parchments. - Joseph A. Goguen; Rod M. Burstall (CTCS, 1985)

A Categorical Unification Algorithm. - David E. Rydeheard; Rod M. Burstall (CTCS, 1985)

Computing with Categories. - David E. Rydeheard; Rod M. Burstall (CTCS, 1985)

Inductively Defined Functions (Extended Abstract). - Rod M. Burstall (TAPSOFT, Vol.1, 1985)

Inductively Defined Functions in Functional Programming Languages. - Rod M. Burstall (J. Comput. Syst. Sci., 1987)

Computational category theory. - David E. Rydeheard; Rod M. Burstall (Prentice Hall, 1988)

A Natural Deduction treatment of Operational Semantics. - Rod M. Burstall; Furio Honsell (FSTTCS, 1988)

Pebble, a Kernel Language for Modules and Abstract Data Types - Butler W. Lampson; Rod M. Burstall (Inf. Comput., 1988)

Some Fundamental Algebraic Tools for the Semantics of Computation: Part 3: Indexed Categories. - Andrzej Tarlecki; Rod M. Burstall; Joseph A. Goguen (Theor. Comput. Sci., 1991)

Extended Calculus of Constructions as a Specification Language (Abstract). - Rod M. Burstall (MPC, 1992)

Institutions: Abstract Model Theory for Specification and Programming. - Joseph A. Goguen; Rod M. Burstall (J. ACM, 1992)

Deliverables: A Categorial Approach to Program Development in Type Theory. - James McKinna; Rod M. Burstall (MFCS, 1993)

Terms, Proofs, and Refinement (Extended abstract) - Rod M. Burstall (LICS, 1994)

Inductively Defined Relations: A Brief Tutorial (Extended Abstract). - Rod M. Burstall (COMPASS/ADT, 1995)

Memory Management: An Abstract Formulation of Incremental Tracing. - Healfdene Goguen; Richard Brooksby; Rod M. Burstall (TYPES, 1999)

Christopher Strachey - Understanding Programming Languages. - Rod M. Burstall (High. Order Symb. Comput., 2000)

ProveEasy: helping people learn to do proofs. - Rod M. Burstall (CATS, 2000)

Explicit Environments. - Masahiko Sato 001; Takafumi Sakurai; Rod M. Burstall (Fundam. Informaticae, 2001)

My Friend Joseph Goguen. - Rod M. Burstall (Essays Dedicated to Joseph A. Goguen, 2006)