Rod M. Burstall
According to our database^{1},
Rod M. Burstall
authored at least 44 papers
between 1965 and 2006.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at viaf.org

at id.loc.gov

at isni.org

at dl.acm.org
On csauthors.net:
Bibliography
2006
My Friend Joseph Goguen.
Proceedings of the Algebra, Meaning, and Computation, 2006
2000
ProveEasy: helping people learn to do proofs.
Electr. Notes Theor. Comput. Sci., 2000
Christopher Strachey  Understanding Programming Languages.
HigherOrder and Symbolic Computation, 2000
1999
Memory Management: An Abstract Formulation of Incremental Tracing.
Proceedings of the Types for Proofs and Programs, 1999
Explicit Environments.
Proceedings of the Typed Lambda Calculi and Applications, 4th International Conference, 1999
1995
Inductively Defined Relations: A Brief Tutorial (Extended Abstract).
Proceedings of the Recent Trends in Data Type Specification, 1995
1994
Terms, Proofs, and Refinement (Extended abstract)
Proceedings of the Ninth Annual Symposium on Logic in Computer Science (LICS '94), 1994
1993
Deliverables: A Categorial Approach to Program Development in Type Theory.
Proceedings of the Mathematical Foundations of Computer Science 1993, 1993
1992
Institutions: Abstract Model Theory for Specification and Programming.
J. ACM, 1992
Extended Calculus of Constructions as a Specification Language (Abstract).
Proceedings of the Mathematics of Program Construction, Second International Conference, Oxford, UK, June 29, 1992
1991
Some Fundamental Algebraic Tools for the Semantics of Computation: Part 3: Indexed Categories.
Theor. Comput. Sci., 1991
1988
Pebble, a Kernel Language for Modules and Abstract Data Types
Inf. Comput., 1988
A Natural Deduction treatment of Operational Semantics.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1988
Computational category theory.
Prentice Hall International Series in Computer Science, Prentice Hall, ISBN: 9780131627369, 1988
1987
Inductively Defined Functions in Functional Programming Languages.
J. Comput. Syst. Sci., 1987
1985
Inductively Defined Functions (Extended Abstract).
Proceedings of the Mathematical Foundations of Software Development, 1985
Computing with Categories.
Proceedings of the Category Theory and Computer Programming, 1985
A Categorical Unification Algorithm.
Proceedings of the Category Theory and Computer Programming, 1985
A Study in the Functions of Programming Methodology: Specifications, Institutions, Charters and Parchments.
Proceedings of the Category Theory and Computer Programming, 1985
1984
Some Fundamental Algebraic Tools for the Semantics of Computation. Part II: Signed and Abstract Theories.
Theor. Comput. Sci., 1984
Some Fundamental Algebraic Tools for the Semantics of Computation. Part 1: Comma Categories, Colimits, Signatures and Theories.
Theor. Comput. Sci., 1984
A Kernel Language for Abstract Data Types and Modules.
Proceedings of the Semantics of Data Types, International Symposium, 1984
Programming with Modules as Typed Functional Programming.
Proceedings of the International Conference on Fifth Generation Computer Systems, 1984
1983
Introducing Institutions.
Proceedings of the Logics of Programs, 1983
Structured Theories in LCF.
Proceedings of the CAAP'83, 1983
1982
Deriving very Efficient Algorithms for Evaluating Linear Recurrence Relations Using the Program Transformation Technique.
Acta Inf., 1982
1980
Making Programs more Readable.
Proceedings of the International Symposium on Programming, 1980
Electronic Category Theory.
Proceedings of the Mathematical Foundations of Computer Science 1980 (MFCS'80), 1980
HOPE: An Experimental Applicative Language.
Proceedings of the 1980 LISP Conference, August 2527, 1980, Stanford, California, USA., 1980
1979
The Semantics of CLEAR, A Specification Language.
Proceedings of the Abstract Software Specifications, 1979 Copenhagen Winter School, January 22, 1979
1977
A Transformation System for Developing Recursive Programs.
J. ACM, 1977
Putting Theories Together to Make Specifications.
Proceedings of the 5th International Joint Conference on Artificial Intelligence. Cambridge, 1977
1976
Subgraph Isomorphism, Matching Relational Structures and Maximal Cliques.
Inf. Process. Lett., 1976
1975
A Versatile System for ComputerControlled Assembly.
Artif. Intell., 1975
1974
Program Proving as Hand Simulation with a Little Induction.
Proceedings of the Information Processing, 1974
The algebraic theory of recursive program schemes.
Proceedings of the Category Theory Applied to Computation and Control, 1974
1973
A System which Automatically Improves Programs.
Proceedings of the 3rd International Joint Conference on Artificial Intelligence. Standford, 1973
A Versatile ComputerControlled Assembly System.
Proceedings of the 3rd International Joint Conference on Artificial Intelligence. Standford, 1973
1969
A Program for Solving Word Sum Puzzles.
Comput. J., 1969
Proving Properties of Programs by Structural Induction.
Comput. J., 1969
1968
Automation Theory and Learning Systems.
Comput. J., 1968
1966
Computer Design of Electricity Supply Networks by a Heuristic Method.
Comput. J., 1966
Book Review: Computer and Information Sciences, by J. T. Tou and R. H. Wilcox, 1965; 544 pages.
Comput. J., 1966
1965
Heuristic and decision tree methods on computers : some operational research applications.
PhD thesis, 1965