Institutions: abstract model theory for specification and programming
- J. Goguen, R. Burstall
- Computer ScienceJACM
- 2 January 1992
This paper says that any institution such that signatures can be glued together, also allows gluing together theories (which are just collections of sentences over a fixed signature), and shows how to define institutions that allow sentences and constraints from two or more institutions.
A Transformation System for Developing Recursive Programs
- R. Burstall, J. Darlington
- Computer ScienceJournal of the ACM
- 1 January 1977
A system of rules for transforming programs is described, with the programs in the form of recursion equations. An initially very simple, lucid, and hopefully correct program is transformed into a…
The Semantics of CLEAR, A Specification Language
- R. Burstall, J. Goguen
- Computer ScienceAbstract Software Specifications
- 22 January 1979
A blend of denotational semantics with categorical ideas is used for the Clear language for specifying problems and programs, described by Burstall and Goguen in 1977.
Putting Theories Together to Make Specifications
- R. Burstall, J. Goguen
- Computer ScienceInternational Joint Conference on Artificial…
- 22 August 1977
The present paper sets forth in an informal way the attempts to clarify and generalise the above methods of building up programs in terms of abstract data structures, which derive from the work on theories.
Introducing Institutions
- J. Goguen, R. Burstall
- Philosophy, Computer ScienceLogic of Programs
- 6 June 1983
This paper shows how some parts of computer science can be done in any suitable logical system, by introducing the notion of an ins as a precise generalization of the informal notion of a mlogical system.
Proving Properties of Programs by Structural Induction
- R. Burstall
- Computer ScienceComputer/law journal
- 1 February 1969
Some syntactic extensions to Landin's functional programming language ISWIM are suggested which make it easier to program the manipulation of data structures and to develop proofs about such programs.
HOPE: An experimental applicative language
- R. Burstall, David B. MacQueen, D. Sannella
- Computer ScienceLISP Conference
- 25 August 1980
An applicative language called HOPE is described and discussed, to produce a very simple programming language which encourages the construction of clear and manipulable programs.
Program Proving as Hand Simulation with a Little Induction
- R. Burstall
- Computer ScienceIFIP Congress
- 1974
Some Techniques for Proving Correctness of Programs which Alter Data Structures
- R. Burstall
- Engineering
- 2013
A metal oxide varistor has a high thermal conductivity potting material encapsulating completely the metal oxide varistor and a portion of the leads therefrom, a pair of metal plates spaced in a…
Computational category theory
- D. Rydeheard, R. Burstall
- MathematicsPrentice Hall International Series in Computer…
- 1 September 1988
...
...