Rod M. Burstall - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 47 from 47

2006

My Friend Joseph GoguenRod M. Burstall. BIRTHDAY 2006: 25-30 [doi]

2001

Explicit EnvironmentsMasahiko Sato, Takafumi Sakurai, Rod M. Burstall. FUIN, 45(1-2):79-115, 2001.

2000

ProveEasy: helping people learn to do proofsRod M. Burstall. TCS, 31:16-32, 2000. [doi]

Christopher Strachey - Understanding Programming LanguagesRod M. Burstall. lisp, 13(1/2):51-55, 2000.

1999

Memory Management: An Abstract Formulation of Incremental TracingHealfdene Goguen, Richard Brooksby, Rod M. Burstall. TYPES 2000: 148-161 [doi]

Explicit EnvironmentsMasahiko Sato, Takafumi Sakurai, Rod M. Burstall. tlca 1999: 340-354 [doi]

1995

Inductively Defined Relations: A Brief Tutorial (Extended Abstract)Rod M. Burstall. compass 1996: 14-16

1994

Terms, Proofs, and Refinement (Extended abstract)Rod M. Burstall. lics 1994: 2-7

1993

Deliverables: A Categorial Approach to Program Development in Type TheoryJames McKinna, Rod M. Burstall. mfcs 1993: 32-67

1992

Extended Calculus of Constructions as a Specification Language (Abstract)Rod M. Burstall. mpc 1993: 1

Institutions: Abstract Model Theory for Specification and ProgrammingJoseph A. Goguen, Rod M. Burstall. JACM, 39(1):95-146, 1992. [doi]

1991

Some Fundamental Algebraic Tools for the Semantics of Computation: Part 3: Indexed CategoriesAndrzej Tarlecki, Rod M. Burstall, Joseph A. Goguen. TCS, 91(2):239-264, 1991.

1988

A Natural Deduction treatment of Operational SemanticsRod M. Burstall, Furio Honsell. fsttcs 1988: 250-269

Pebble, a Kernel Language for Modules and Abstract Data TypesButler W. Lampson, Rod M. Burstall. iandc, 76(2/3):278-346, February/March 1988.

Computational category theoryDavid E. Rydeheard, Rod M. Burstall. Prentice Hall International Series in Computer Science, Prentice Hall, 1988.

1987

Inductively Defined Functions in Functional Programming LanguagesRod M. Burstall. jcss, 34(2/3):409-421, 1987.

1985

Inductively Defined Functions (Extended Abstract)Rod M. Burstall. tapsoft 1985: 92-96

A Study in the Functions of Programming Methodology: Specifications, Institutions, Charters and ParchmentsJoseph A. Goguen, Rod M. Burstall. ctcs 1986: 313-333

A Categorical Unification AlgorithmDavid E. Rydeheard, Rod M. Burstall. ctcs 1986: 493-505

Computing with CategoriesDavid E. Rydeheard, Rod M. Burstall. ctcs 1986: 506-519

1984

Programming with Modules as Typed Functional ProgrammingRod M. Burstall. fgcs 1984: 103-112

A Kernel Language for Abstract Data Types and ModulesRod M. Burstall, Butler W. Lampson. sdt 1984: 1-50

Some Fundamental Algebraic Tools for the Semantics of Computation. Part 1: Comma Categories, Colimits, Signatures and TheoriesJoseph A. Goguen, Rod M. Burstall. TCS, 31:175-209, 1984.

Some Fundamental Algebraic Tools for the Semantics of Computation. Part II: Signed and Abstract TheoriesJoseph A. Goguen, Rod M. Burstall. TCS, 31:263-295, 1984.

1983

Introducing InstitutionsJoseph A. Goguen, Rod M. Burstall. lop 1984: 221-256

Structured Theories in LCFDonald Sannella, Rod M. Burstall. caap 1983: 377-391

1982

Deriving very Efficient Algorithms for Evaluating Linear Recurrence Relations Using the Program Transformation TechniqueAlberto Pettorossi, Rod M. Burstall. ACTA, 18:181-206, 1982.

1980

Electronic Category TheoryRod M. Burstall. mfcs 1980: 22-39

HOPE: An Experimental Applicative LanguageRod M. Burstall, David B. MacQueen, Donald Sannella. lfp 1980: 136-143 [doi]

Making Programs more ReadableJ. L. Weiner, Rod M. Burstall. programm 1980: 327-341

1979

The Semantics of CLEAR, A Specification LanguageRod M. Burstall, Joseph A. Goguen. ac 1980: 292-332

1977

A Transformation System for Developing Recursive ProgramsRod M. Burstall, John Darlington. JACM, 24(1):44-67, 1977. [doi]

Putting Theories Together to Make SpecificationsRod M. Burstall, Joseph A. Goguen. IJCAI 1977: 1045-1058

1976

Subgraph Isomorphism, Matching Relational Structures and Maximal CliquesHarry G. Barrow, Rod M. Burstall. ipl, 4(4):83-84, 1976.

A System which Automatically Improves ProgramsJohn Darlington, Rod M. Burstall. ACTA, 6:41-60, 1976.

1975

A Versatile System for Computer-Controlled AssemblyA. P. Ambler, Harry G. Barrow, Christopher M. Brown, Rod M. Burstall, Robin J. Popplestone. ai, 6(2):129-156, 1975.

Some transformations for developing recursive programsRod M. Burstall, John Darlington. relsoft 1975: 465-472 [doi]

1974

Program Proving as Hand Simulation with a Little InductionRod M. Burstall. ifip 1974: 308-312

The algebraic theory of recursive program schemesRod M. Burstall, James W. Thatcher. category 1975: 126-131

1973

A Versatile Computer-Controlled Assembly SystemA. P. Ambler, Harry G. Barrow, Christopher M. Brown, Rod M. Burstall, Robin J. Popplestone. IJCAI 1973: 298-307

A System which Automatically Improves ProgramsJohn Darlington, Rod M. Burstall. IJCAI 1973: 479-485

1972

An algebraic description of programs with assertions, verification and simulationRod M. Burstall. praapr 1972: 7-14 [doi]

1969

A Program for Solving Word Sum PuzzlesRod M. Burstall. cj, 12(1):48-51, 1969. [doi]

Proving Properties of Programs by Structural InductionRod M. Burstall. cj, 12(1):41-48, 1969. [doi]

1968

Automation Theory and Learning SystemsRod M. Burstall. cj, 11(2):168, 1968. [doi]

1966

Book Review: Computer and Information Sciences, by J. T. Tou and R. H. Wilcox, 1965; 544 pagesRod M. Burstall. cj, 9(1):15, 1966. [doi]

Computer Design of Electricity Supply Networks by a Heuristic MethodRod M. Burstall. cj, 9(3):263-274, 1966. [doi]

Sign in or sign up to see more results.

runs on WebDSL