The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Rod M. Burstall: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Rod M. Burstall, John Darlington
    A Transformation System for Developing Recursive Programs. [Citation Graph (10, 0)][DBLP]
    J. ACM, 1977, v:24, n:1, pp:44-67 [Journal]
  2. John Darlington, Rod M. Burstall
    A System which Automatically Improves Programs. [Citation Graph (5, 0)][DBLP]
    Acta Inf., 1976, v:6, n:, pp:41-60 [Journal]
  3. Rod M. Burstall, Joseph A. Goguen
    Putting Theories Together to Make Specifications. [Citation Graph (2, 0)][DBLP]
    IJCAI, 1977, pp:1045-1058 [Conf]
  4. Rod M. Burstall, Joseph A. Goguen
    The Semantics of CLEAR, A Specification Language. [Citation Graph (0, 0)][DBLP]
    Abstract Software Specifications, 1979, pp:292-332 [Conf]
  5. Rod M. Burstall
    My Friend Joseph Goguen. [Citation Graph (0, 0)][DBLP]
    Essays Dedicated to Joseph A. Goguen, 2006, pp:25-30 [Conf]
  6. Donald Sannella, Rod M. Burstall
    Structured Theories in LCF. [Citation Graph (0, 0)][DBLP]
    CAAP, 1983, pp:377-391 [Conf]
  7. Rod M. Burstall, James W. Thatcher
    The algebraic theory of recursive program schemes. [Citation Graph (0, 0)][DBLP]
    Category Theory Applied to Computation and Control, 1974, pp:126-131 [Conf]
  8. Rod M. Burstall
    Inductively Defined Relations: A Brief Tutorial (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    COMPASS/ADT, 1995, pp:14-16 [Conf]
  9. David E. Rydeheard, Rod M. Burstall
    A Categorical Unification Algorithm. [Citation Graph (0, 0)][DBLP]
    CTCS, 1985, pp:493-505 [Conf]
  10. David E. Rydeheard, Rod M. Burstall
    Computing with Categories. [Citation Graph (0, 0)][DBLP]
    CTCS, 1985, pp:506-519 [Conf]
  11. Joseph A. Goguen, Rod M. Burstall
    A Study in the Functions of Programming Methodology: Specifications, Institutions, Charters and Parchments. [Citation Graph (0, 0)][DBLP]
    CTCS, 1985, pp:313-333 [Conf]
  12. Rod M. Burstall
    Programming with Modules as Typed Functional Programming. [Citation Graph (0, 0)][DBLP]
    FGCS, 1984, pp:103-112 [Conf]
  13. Rod M. Burstall, Furio Honsell
    A Natural Deduction treatment of Operational Semantics. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1988, pp:250-269 [Conf]
  14. Rod M. Burstall
    Program Proving as Hand Simulation with a Little Induction. [Citation Graph (0, 0)][DBLP]
    IFIP Congress, 1974, pp:308-312 [Conf]
  15. A. P. Ambler, Harry G. Barrow, Christopher M. Brown, Rod M. Burstall, Robin J. Popplestone
    A Versatile Computer-Controlled Assembly System. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1973, pp:298-307 [Conf]
  16. John Darlington, Rod M. Burstall
    A System which Automatically Improves Programs. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1973, pp:479-485 [Conf]
  17. Rod M. Burstall, David B. MacQueen, Donald Sannella
    HOPE: An Experimental Applicative Language. [Citation Graph (0, 0)][DBLP]
    LISP Conference, 1980, pp:136-143 [Conf]
  18. Rod M. Burstall
    Terms, Proofs, and Refinement (Extended abstract) [Citation Graph (0, 0)][DBLP]
    LICS, 1994, pp:2-7 [Conf]
  19. Joseph A. Goguen, Rod M. Burstall
    Introducing Institutions. [Citation Graph (0, 0)][DBLP]
    Logic of Programs, 1983, pp:221-256 [Conf]
  20. Rod M. Burstall
    Electronic Category Theory. [Citation Graph (0, 0)][DBLP]
    MFCS, 1980, pp:22-39 [Conf]
  21. James McKinna, Rod M. Burstall
    Deliverables: A Categorial Approach to Program Development in Type Theory. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:32-67 [Conf]
  22. Rod M. Burstall
    Extended Calculus of Constructions as a Specification Language (Abstract). [Citation Graph (0, 0)][DBLP]
    MPC, 1992, pp:1- [Conf]
  23. J. L. Weiner, Rod M. Burstall
    Making Programs more Readable. [Citation Graph (0, 0)][DBLP]
    Symposium on Programming, 1980, pp:327-341 [Conf]
  24. Rod M. Burstall, Butler W. Lampson
    A Kernel Language for Abstract Data Types and Modules. [Citation Graph (0, 0)][DBLP]
    Semantics of Data Types, 1984, pp:1-50 [Conf]
  25. Rod M. Burstall
    Inductively Defined Functions (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1985, pp:92-96 [Conf]
  26. Masahiko Sato, Takafumi Sakurai, Rod M. Burstall
    Explicit Environments. [Citation Graph (0, 0)][DBLP]
    TLCA, 1999, pp:340-354 [Conf]
  27. Healfdene Goguen, Richard Brooksby, Rod M. Burstall
    Memory Management: An Abstract Formulation of Incremental Tracing. [Citation Graph (0, 0)][DBLP]
    TYPES, 1999, pp:148-161 [Conf]
  28. Alberto Pettorossi, Rod M. Burstall
    Deriving very Efficient Algorithms for Evaluating Linear Recurrence Relations Using the Program Transformation Technique. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1982, v:18, n:, pp:181-206 [Journal]
  29. A. P. Ambler, Harry G. Barrow, Christopher M. Brown, Rod M. Burstall, Robin J. Popplestone
    A Versatile System for Computer-Controlled Assembly. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1975, v:6, n:2, pp:129-156 [Journal]
  30. Masahiko Sato, Takafumi Sakurai, Rod M. Burstall
    Explicit Environments. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2001, v:45, n:1-2, pp:79-115 [Journal]
  31. Butler W. Lampson, Rod M. Burstall
    Pebble, a Kernel Language for Modules and Abstract Data Types [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1988, v:76, n:2/3, pp:278-346 [Journal]
  32. Harry G. Barrow, Rod M. Burstall
    Subgraph Isomorphism, Matching Relational Structures and Maximal Cliques. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1976, v:4, n:4, pp:83-84 [Journal]
  33. Joseph A. Goguen, Rod M. Burstall
    Institutions: Abstract Model Theory for Specification and Programming. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1992, v:39, n:1, pp:95-146 [Journal]
  34. Rod M. Burstall
    Inductively Defined Functions in Functional Programming Languages. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1987, v:34, n:2/3, pp:409-421 [Journal]
  35. Rod M. Burstall
    Christopher Strachey - Understanding Programming Languages. [Citation Graph (0, 0)][DBLP]
    Higher-Order and Symbolic Computation, 2000, v:13, n:1/2, pp:51-55 [Journal]
  36. Rod M. Burstall
    ProveEasy: helping people learn to do proofs. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2000, v:31, n:, pp:- [Journal]
  37. Joseph A. Goguen, Rod M. Burstall
    Some Fundamental Algebraic Tools for the Semantics of Computation. Part 1: Comma Categories, Colimits, Signatures and Theories. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:31, n:, pp:175-209 [Journal]
  38. Joseph A. Goguen, Rod M. Burstall
    Some Fundamental Algebraic Tools for the Semantics of Computation. Part II: Signed and Abstract Theories. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:31, n:, pp:263-295 [Journal]
  39. Andrzej Tarlecki, Rod M. Burstall, Joseph A. Goguen
    Some Fundamental Algebraic Tools for the Semantics of Computation: Part 3: Indexed Categories. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:91, n:2, pp:239-264 [Journal]

Search in 0.007secs, Finished in 0.009secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002