default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRod M. Burstall
Person information
- affiliation: University of Edinburgh, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2006
[c28]Rod M. Burstall:
My Friend Joseph Goguen. Essays Dedicated to Joseph A. Goguen 2006: 25-30- 2001
- [j18]Masahiko Sato, Takafumi Sakurai, Rod M. Burstall:
Explicit Environments. Fundam. Informaticae 45(1-2): 79-115 (2001) - 2000
- [j17]Rod M. Burstall:
Christopher Strachey - Understanding Programming Languages. High. Order Symb. Comput. 13(1/2): 51-55 (2000) - [c27]Rod M. Burstall:
ProveEasy: helping people learn to do proofs. CATS 2000: 16-32
1990 – 1999
- 1999
- [c26]Masahiko Sato, Takafumi Sakurai, Rod M. Burstall:
Explicit Environments. TLCA 1999: 340-354 - [c25]Healfdene Goguen, Richard Brooksby, Rod M. Burstall:
Memory Management: An Abstract Formulation of Incremental Tracing. TYPES 1999: 148-161 - 1995
- [c24]Rod M. Burstall:
Inductively Defined Relations: A Brief Tutorial (Extended Abstract). COMPASS/ADT 1995: 14-16 - 1994
- [c23]Rod M. Burstall:
Terms, Proofs, and Refinement (Extended abstract). LICS 1994: 2-7 - 1993
- [c22]James McKinna, Rod M. Burstall:
Deliverables: A Categorial Approach to Program Development in Type Theory. MFCS 1993: 32-67 - 1992
- [j16]Joseph A. Goguen, Rod M. Burstall:
Institutions: Abstract Model Theory for Specification and Programming. J. ACM 39(1): 95-146 (1992) - [c21]Rod M. Burstall:
Extended Calculus of Constructions as a Specification Language (Abstract). MPC 1992: 1 - 1991
- [j15]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): 239-264 (1991)
1980 – 1989
- 1988
- [b2]David E. Rydeheard, Rod M. Burstall:
Computational category theory. Prentice Hall International Series in Computer Science, Prentice Hall 1988, ISBN 978-0-13-162736-9, pp. I-XIV, 1-257 - [j14]Butler W. Lampson, Rod M. Burstall:
Pebble, a Kernel Language for Modules and Abstract Data Types. Inf. Comput. 76(2/3): 278-346 (1988) - [c20]Rod M. Burstall, Furio Honsell:
A Natural Deduction treatment of Operational Semantics. FSTTCS 1988: 250-269 - 1987
- [j13]Rod M. Burstall:
Inductively Defined Functions in Functional Programming Languages. J. Comput. Syst. Sci. 34(2/3): 409-421 (1987) - 1985
- [c19]Joseph A. Goguen, Rod M. Burstall:
A Study in the Functions of Programming Methodology: Specifications, Institutions, Charters and Parchments. CTCS 1985: 313-333 - [c18]David E. Rydeheard, Rod M. Burstall:
A Categorical Unification Algorithm. CTCS 1985: 493-505 - [c17]David E. Rydeheard, Rod M. Burstall:
Computing with Categories. CTCS 1985: 506-519 - [c16]Rod M. Burstall:
Inductively Defined Functions (Extended Abstract). TAPSOFT, Vol.1 1985: 92-96 - 1984
- [j12]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: 175-209 (1984) - [j11]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: 263-295 (1984) - [c15]Rod M. Burstall:
Programming with Modules as Typed Functional Programming. FGCS 1984: 103-112 - [c14]Rod M. Burstall, Butler W. Lampson:
A Kernel Language for Abstract Data Types and Modules. Semantics of Data Types 1984: 1-50 - 1983
- [c13]Donald Sannella, Rod M. Burstall:
Structured Theories in LCF. CAAP 1983: 377-391 - [c12]Joseph A. Goguen, Rod M. Burstall:
Introducing Institutions. Logic of Programs 1983: 221-256 - 1982
- [j10]Alberto Pettorossi, Rod M. Burstall:
Deriving very Efficient Algorithms for Evaluating Linear Recurrence Relations Using the Program Transformation Technique. Acta Informatica 18: 181-206 (1982) - 1980
- [c11]Rod M. Burstall, David B. MacQueen, Donald Sannella:
HOPE: An Experimental Applicative Language. LISP Conference 1980: 136-143 - [c10]Rod M. Burstall:
Electronic Category Theory. MFCS 1980: 22-39 - [c9]J. L. Weiner, Rod M. Burstall:
Making Programs more Readable. Symposium on Programming 1980: 327-341
1970 – 1979
- 1979
- [c8]Rod M. Burstall, Joseph A. Goguen:
The Semantics of CLEAR, A Specification Language. Abstract Software Specifications 1979: 292-332 - 1977
- [j9]Rod M. Burstall, John Darlington:
A Transformation System for Developing Recursive Programs. J. ACM 24(1): 44-67 (1977) - [c7]Rod M. Burstall, Joseph A. Goguen:
Putting Theories Together to Make Specifications. IJCAI 1977: 1045-1058 - 1976
- [j8]John Darlington, Rod M. Burstall:
A System which Automatically Improves Programs. Acta Informatica 6: 41-60 (1976) - [j7]Harry G. Barrow, Rod M. Burstall:
Subgraph Isomorphism, Matching Relational Structures and Maximal Cliques. Inf. Process. Lett. 4(4): 83-84 (1976) - 1975
- [j6]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): 129-156 (1975) - [c6]Rod M. Burstall, John Darlington:
Some transformations for developing recursive programs. Reliable Software 1975: 465-472 - 1974
- [c5]Rod M. Burstall, James W. Thatcher:
The algebraic theory of recursive program schemes. Category Theory Applied to Computation and Control 1974: 126-131 - [c4]Rod M. Burstall:
Program Proving as Hand Simulation with a Little Induction. IFIP Congress 1974: 308-312 - 1973
- [c3]A. Patricia Ambler, Harry G. Barrow, Christopher M. Brown, Rod M. Burstall, Robin J. Popplestone:
A Versatile Computer-Controlled Assembly System. IJCAI 1973: 298-307 - [c2]John Darlington, Rod M. Burstall:
A System which Automatically Improves Programs. IJCAI 1973: 479-485 - 1972
- [c1]Rod M. Burstall:
An algebraic description of programs with assertions, verification and simulation. Proving Assertions About Programs 1972: 7-14
1960 – 1969
- 1969
- [j5]Rod M. Burstall:
Proving Properties of Programs by Structural Induction. Comput. J. 12(1): 41-48 (1969) - [j4]Rod M. Burstall:
A Program for Solving Word Sum Puzzles. Comput. J. 12(1): 48-51 (1969) - 1968
- [j3]Rod M. Burstall:
Automation Theory and Learning Systems. Comput. J. 11(2): 168 (1968) - 1966
- [j2]Rod M. Burstall:
Book Review: Computer and Information Sciences, by J. T. Tou and R. H. Wilcox, 1965; 544 pages. Comput. J. 9(1): 15 (1966) - [j1]Rod M. Burstall:
Computer Design of Electricity Supply Networks by a Heuristic Method. Comput. J. 9(3): 263-274 (1966) - 1965
- [b1]Rodney Martineau Burstall:
Heuristic and decision tree methods on computers : some operational research applications. University of Birmingham, UK, 1965
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:04 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
