Rod M. Burstall

47 papers A* 4B 3Journal 18Unranked 21

Year	Rank	Type	Title / Venue / Authors
2006	—	`conf`	My Friend Joseph Goguen. Essays Dedicated to Joseph A. Goguen Rod M. Burstall
2001	J	`jnl`	Explicit Environments. Fundam. Informaticae Masahiko Sato, Takafumi Sakurai, Rod M. Burstall
2000	J	`jnl`	Christopher Strachey - Understanding Programming Languages. High. Order Symb. Comput. Rod M. Burstall
2000	—	`conf`	ProveEasy: helping people learn to do proofs. CATS Rod M. Burstall
1999	—	`conf`	Explicit Environments. TLCA Masahiko Sato, Takafumi Sakurai, Rod M. Burstall
1999	—	`conf`	Memory Management: An Abstract Formulation of Incremental Tracing. TYPES Healfdene Goguen, Richard Brooksby, Rod M. Burstall
1995	—	`conf`	Inductively Defined Relations: A Brief Tutorial (Extended Abstract). COMPASS/ADT Rod M. Burstall
1994	A*	`conf`	Terms, Proofs, and Refinement (Extended abstract) LICS Rod M. Burstall
1993	B	`conf`	Deliverables: A Categorial Approach to Program Development in Type Theory. MFCS James McKinna, Rod M. Burstall
1992	B	`conf`	Extended Calculus of Constructions as a Specification Language (Abstract). MPC Rod M. Burstall
1992	J	`jnl`	Institutions: Abstract Model Theory for Specification and Programming. J. ACM Joseph A. Goguen, Rod M. Burstall
1991	J	`jnl`	Some Fundamental Algebraic Tools for the Semantics of Computation: Part 3: Indexed Categories. Theor. Comput. Sci. Andrzej Tarlecki, Rod M. Burstall, Joseph A. Goguen
1988	—	`conf`	A Natural Deduction treatment of Operational Semantics. FSTTCS Rod M. Burstall, Furio Honsell
1988	—	`book`	Computational category theory. David E. Rydeheard, Rod M. Burstall
1988	J	`jnl`	Pebble, a Kernel Language for Modules and Abstract Data Types Inf. Comput. Butler W. Lampson, Rod M. Burstall
1987	J	`jnl`	Inductively Defined Functions in Functional Programming Languages. J. Comput. Syst. Sci. Rod M. Burstall
1985	—	`conf`	A Categorical Unification Algorithm. CTCS David E. Rydeheard, Rod M. Burstall
1985	—	`conf`	A Study in the Functions of Programming Methodology: Specifications, Institutions, Charters and Parchments. CTCS Joseph A. Goguen, Rod M. Burstall
1985	—	`conf`	Computing with Categories. CTCS David E. Rydeheard, Rod M. Burstall
1985	—	`conf`	Inductively Defined Functions (Extended Abstract). TAPSOFT, Vol.1 Rod M. Burstall
1984	—	`conf`	A Kernel Language for Abstract Data Types and Modules. Semantics of Data Types Rod M. Burstall, Butler W. Lampson
1984	—	`conf`	Programming with Modules as Typed Functional Programming. FGCS Rod M. Burstall
1984	J	`jnl`	Some Fundamental Algebraic Tools for the Semantics of Computation. Part 1: Comma Categories, Colimits, Signatures and Theories. Theor. Comput. Sci. Joseph A. Goguen, Rod M. Burstall
1984	J	`jnl`	Some Fundamental Algebraic Tools for the Semantics of Computation. Part II: Signed and Abstract Theories. Theor. Comput. Sci. Joseph A. Goguen, Rod M. Burstall
1983	—	`conf`	Introducing Institutions. Logic of Programs Joseph A. Goguen, Rod M. Burstall
1983	—	`conf`	Structured Theories in LCF. CAAP Donald Sannella, Rod M. Burstall
1982	J	`jnl`	Deriving very Efficient Algorithms for Evaluating Linear Recurrence Relations Using the Program Transformation Technique. Acta Informatica Alberto Pettorossi, Rod M. Burstall
1980	B	`conf`	Electronic Category Theory. MFCS Rod M. Burstall
1980	—	`conf`	HOPE: An Experimental Applicative Language. LISP Conference Rod M. Burstall, David B. MacQueen, Donald Sannella
1980	—	`conf`	Making Programs more Readable. Symposium on Programming J. L. Weiner, Rod M. Burstall
1979	—	`conf`	The Semantics of CLEAR, A Specification Language. Abstract Software Specifications Rod M. Burstall, Joseph A. Goguen
1977	J	`jnl`	A Transformation System for Developing Recursive Programs. J. ACM Rod M. Burstall, John Darlington
1977	A*	`conf`	Putting Theories Together to Make Specifications. IJCAI Rod M. Burstall, Joseph A. Goguen
1976	J	`jnl`	A System which Automatically Improves Programs. Acta Informatica John Darlington, Rod M. Burstall
1976	J	`jnl`	Subgraph Isomorphism, Matching Relational Structures and Maximal Cliques. Inf. Process. Lett. Harry G. Barrow, Rod M. Burstall
1975	J	`jnl`	A Versatile System for Computer-Controlled Assembly. Artif. Intell. A. Patricia Ambler, Harry G. Barrow, Christopher M. Brown, Rod M. Burstall, Robin J. Popplestone
1975	—	`conf`	Some transformations for developing recursive programs. Reliable Software Rod M. Burstall, John Darlington
1974	—	`conf`	Program Proving as Hand Simulation with a Little Induction. IFIP Congress Rod M. Burstall
1974	—	`conf`	The algebraic theory of recursive program schemes. Category Theory Applied to Computation and Control Rod M. Burstall, James W. Thatcher
1973	A*	`conf`	A System which Automatically Improves Programs. IJCAI John Darlington, Rod M. Burstall
1973	A*	`conf`	A Versatile Computer-Controlled Assembly System. IJCAI A. Patricia Ambler, Harry G. Barrow, Christopher M. Brown, Rod M. Burstall, Robin J. Popplestone
1972	—	`conf`	An algebraic description of programs with assertions, verification and simulation. Proving Assertions About Programs Rod M. Burstall
1969	J	`jnl`	A Program for Solving Word Sum Puzzles. Comput. J. Rod M. Burstall
1969	J	`jnl`	Proving Properties of Programs by Structural Induction. Comput. J. Rod M. Burstall
1968	J	`jnl`	Automation Theory and Learning Systems. Comput. J. Rod M. Burstall
1966	J	`jnl`	Book Review: Computer and Information Sciences, by J. T. Tou and R. H. Wilcox, 1965; 544 pages. Comput. J. Rod M. Burstall
1966	J	`jnl`	Computer Design of Electricity Supply Networks by a Heuristic Method. Comput. J. Rod M. Burstall