Rod M. Burstall

Publication Activity (10 Years)

Years Active: 1966-2006
Publications (10 Years): 0

Publications

Rod M. Burstall
My Friend Joseph Goguen. Essays Dedicated to Joseph A. Goguen (2006)
Masahiko Sato, Takafumi Sakurai, Rod M. Burstall
Explicit Environments. Fundam. Informaticae 45 (1-2) (2001)
Rod M. Burstall
ProveEasy: helping people learn to do proofs. Electron. Notes Theor. Comput. Sci. 31 (2000)
Rod M. Burstall
Christopher Strachey - Understanding Programming Languages. High. Order Symb. Comput. 13 (1/2) (2000)
Healfdene Goguen, Richard Brooksby, Rod M. Burstall
Memory Management: An Abstract Formulation of Incremental Tracing. TYPES (1999)
Masahiko Sato, Takafumi Sakurai, Rod M. Burstall
Explicit Environments. TLCA (1999)
Rod M. Burstall
Inductively Defined Relations: A Brief Tutorial (Extended Abstract). COMPASS/ADT (1995)
Rod M. Burstall
Terms, Proofs, and Refinement (Extended abstract) LICS (1994)
James McKinna, Rod M. Burstall
Deliverables: A Categorial Approach to Program Development in Type Theory. MFCS (1993)
Rod M. Burstall
Extended Calculus of Constructions as a Specification Language (Abstract). MPC (1992)
Joseph A. Goguen, Rod M. Burstall
Institutions: Abstract Model Theory for Specification and Programming. J. ACM 39 (1) (1992)
Andrzej Tarlecki, Rod M. Burstall, Joseph A. Goguen
Some Fundamental Algebraic Tools for the Semantics of Computation: Part 3: Indexed Categories. Theor. Comput. Sci. 91 (2) (1991)
Rod M. Burstall, Furio Honsell
A Natural Deduction treatment of Operational Semantics. FSTTCS (1988)
Butler W. Lampson, Rod M. Burstall
Pebble, a Kernel Language for Modules and Abstract Data Types Inf. Comput. 76 (2/3) (1988)
Rod M. Burstall
Inductively Defined Functions in Functional Programming Languages. J. Comput. Syst. Sci. 34 (2/3) (1987)
David E. Rydeheard, Rod M. Burstall
A Categorical Unification Algorithm. CTCS (1985)
David E. Rydeheard, Rod M. Burstall
Computing with Categories. CTCS (1985)
Rod M. Burstall
Inductively Defined Functions (Extended Abstract). TAPSOFT, Vol.1 (1985)
Joseph A. Goguen, Rod M. Burstall
A Study in the Functions of Programming Methodology: Specifications, Institutions, Charters and Parchments. CTCS (1985)
Joseph A. Goguen, Rod M. Burstall
Some Fundamental Algebraic Tools for the Semantics of Computation. Part 1: Comma Categories, Colimits, Signatures and Theories. Theor. Comput. Sci. 31 (1984)
Rod M. Burstall, Butler W. Lampson
A Kernel Language for Abstract Data Types and Modules. Semantics of Data Types (1984)
Joseph A. Goguen, Rod M. Burstall
Some Fundamental Algebraic Tools for the Semantics of Computation. Part II: Signed and Abstract Theories. Theor. Comput. Sci. 31 (1984)
Rod M. Burstall
Programming with Modules as Typed Functional Programming. FGCS (1984)
Donald Sannella, Rod M. Burstall
Structured Theories in LCF. CAAP (1983)
Joseph A. Goguen, Rod M. Burstall
Introducing Institutions. Logic of Programs (1983)
Alberto Pettorossi, Rod M. Burstall
Deriving very Efficient Algorithms for Evaluating Linear Recurrence Relations Using the Program Transformation Technique. Acta Informatica 18 (1982)
Rod M. Burstall, David B. MacQueen, Donald Sannella
HOPE: An Experimental Applicative Language. LISP Conference (1980)
J. L. Weiner, Rod M. Burstall
Making Programs more Readable. Symposium on Programming (1980)
Rod M. Burstall
Electronic Category Theory. MFCS (1980)
Rod M. Burstall, Joseph A. Goguen
The Semantics of CLEAR, A Specification Language. Abstract Software Specifications (1979)
Rod M. Burstall, Joseph A. Goguen
Putting Theories Together to Make Specifications. IJCAI (1977)
Rod M. Burstall, John Darlington
A Transformation System for Developing Recursive Programs. J. ACM 24 (1) (1977)
Harry G. Barrow, Rod M. Burstall
Subgraph Isomorphism, Matching Relational Structures and Maximal Cliques. Inf. Process. Lett. 4 (4) (1976)
John Darlington, Rod M. Burstall
A System which Automatically Improves Programs. Acta Informatica 6 (1976)
Rod M. Burstall, John Darlington
Some transformations for developing recursive programs. Reliable Software (1975)
A. Patricia Ambler, Harry G. Barrow, Christopher M. Brown, Rod M. Burstall, Robin J. Popplestone
A Versatile System for Computer-Controlled Assembly. Artif. Intell. 6 (2) (1975)
Rod M. Burstall, James W. Thatcher
The algebraic theory of recursive program schemes. Category Theory Applied to Computation and Control (1974)
Rod M. Burstall
Program Proving as Hand Simulation with a Little Induction. IFIP Congress (1974)
John Darlington, Rod M. Burstall
A System which Automatically Improves Programs. IJCAI (1973)
A. Patricia Ambler, Harry G. Barrow, Christopher M. Brown, Rod M. Burstall, Robin J. Popplestone
A Versatile Computer-Controlled Assembly System. IJCAI (1973)
Rod M. Burstall
An algebraic description of programs with assertions, verification and simulation. Proving Assertions About Programs (1972)
Rod M. Burstall
Proving Properties of Programs by Structural Induction. Comput. J. 12 (1) (1969)
Rod M. Burstall
A Program for Solving Word Sum Puzzles. Comput. J. 12 (1) (1969)
Rod M. Burstall
Automation Theory and Learning Systems. Comput. J. 11 (2) (1968)
Rod M. Burstall
Computer Design of Electricity Supply Networks by a Heuristic Method. Comput. J. 9 (3) (1966)
Rod M. Burstall
Book Review: Computer and Information Sciences, by J. T. Tou and R. H. Wilcox, 1965; 544 pages. Comput. J. 9 (1) (1966)