A Bibliography of Publications of Jim Grundy

Jim Grundy Department of Computer Science The Australian National University Canberra ACT 0200 AUSTRALIA Tel: ?n/a? FAX: +61 (0)6 249-0010 E-mail: [email protected] (Internet) 25 November 2011 Version 1.15

Abstract Hierarchical [Gru96c]. Higher [vWGH96a]. HOL [Gru91a]. This bibliography records publications of Jim Grundy. Inference [Gru91d].

Library [Gru91a]. Logic [Gru93c]. Title word cross-reference Logics [vWGH96a].

11th [GN98b]. m [Gru91c]. m-EVES [Gru91c]. Method [Gru93a]. 9th [vWGH96a]. October [GN98b]. Order [vWGH96a]. August [vWGH96b]. pair [Gru91a]. Predicative [Gru93b]. Browsable [Gru96a]. Presentation [Gru96a]. Proceedings [vWGH96a]. Calculational [BGv96a]. Program [Gru93a]. Calculator [BGL+97]. Programming [Gru93b]. Proof [Gru96a]. Conference [vWGH96a]. Proofs [GL96]. Proving [vWGH96a]. emerging [GN98b]. EVES [Gru91c]. Reasoning [Gru96c]. Record [GL96]. Exchange [Gru96d]. Recording [GL97]. Refinement [Gru92]. Report [Gru91c]. Format [Gru96a].

1 REFERENCES 2

September [GN98b]. Storage [Gru96d]. berra ACT 0200, Australia, Structured [BGv96a]. November 1996. Supplementary [vWGH96a]. Grundy:1996:SCT Support [BGL+97]. Survey [Gru93b]. System [Gru91d]. [BGv96b] Ralph Back, Jim Grundy, and Joakim von Wright. Structured Theorem [vWGH96a]. Theorems [Gru96d]. calculational proof. TUCS Tech- Three [Gru93c]. Three-Valued [Gru93c]. nical Report 65, Turku Cen- To ol [Gru92]. TPHOLs’96 [vWGH96a]. tre for Computer Science, Lem- TPHOLs’98 [GN98b]. mink¨aisenkatu 14, FIN-20520 Transformational [Gru96c]. Turku, Finland, November 1996. trends [GN98b]. Trustworthy [Gru96d]. Grundy:1996:TBR

Valued [Gru93c]. [GL96] Jim Grundy and Thomas L˚angbacka. Towards a browsable record of window [Gru91b]. HOL proofs. TUCS Techni- cal Report 7, Turku Centre for Computer Science, Lem- References mink¨aisenkatu 14, FIN-20520 Butler:1997:RCP Turku, Finland, May 1996. Grundy:1997:RHP [BGL+97] Michael Butler, Jim Grundy, Thomas L˚angbacka, Rimvy- [GL97] Jim Grundy and Thomas L˚angbacka. das Rukˇs˙enas, and Joakim von Recording HOL proofs in a struc- Wright. The refinement calcu- tured browsable format. In lator: Proof support for pro- Michael Johnson, editor, Alge- gram refinement. In Lindsay braic Methodology and Software Groves and Steve Reeves, edi- Technology: 6th International tors, Formal Methods Pacific’97: Conference, AMAST’97, volume Proceedings of FMP’97, Dis- 1349 of Lecture Notes in Com- crete Mathematics & Theoreti- puter Science, pages 567–571. cal Computer Science, pages 40– Springer-Verlag, Sydney, Aus- 61. Springer-Verlag, Wellington, tralia, December 1997. New Zealand, July 1997. Grundy:1998:TPH Grundy:1996:SCA [GN98a] Jim Grundy and Malcolm Newey, [BGv96a] Ralph Back, Jim Grundy, and editors. Theorem proving in Joakim von Wright. Struc- higher order logics: 11th interna- tured calculational proof. Joint tional conference, TPHOLs’98, Computer Science Technical Re- Canberra, Australia, September port TR-CS-96-09, Department 27 – October 1, 1997: pro- of Computer Science, The Aus- ceedings, volume 1479 of Lec- tralian National University, Can- ture Notes in Computer Science. REFERENCES 3

Springer-Verlag, Berlin, 1998. Technology Division, Defence ISBN 3-540-64987-5. ISSN 0302- Science & Technology Organisa- 9743 (print), 1611-3349 (elec- tion, PO Box 1500, Salisbury SA tronic). LCCN QA76.9.A96T655 5108, Australia, March 1991. 1998. Grundy:1991:WIH Grundy:1998:TPE [Gru91d] Jim Grundy. Window infer- [GN98b] Jim Grundy and Malcolm Newey, ence in the HOL system. In editors. Theorem proving in Myla Archer, Jeffrey J. Joyce, higher order logics: emerging Karl N. Levitt, and Phillip J. trends: 11th international con- Windley, editors, Proceedings of ference, TPHOLs’98, Canberra, the International Tutorial and Australia, September 27 – Octo- Workshop on the HOL Theorem ber 1, 1997: supplementary pro- Proving System and its Appli- ceedings, number 98-08 in Joint cations, pages 177–189. ACM- Computer Science Technical Re- SIGDA, IEEE Computer Society ports. Department of Computer Press, University of California at Science, The Australian National Davis, August 1991. University, Canberra ACT 0200, Australia, 1998. ISBN 0-7315- Grundy:1992:WIT 4800-0. [Gru92] Jim Grundy. A window inference Grundy:1991:HPL tool for refinement. In Cliff B. [Gru91a] Jim Grundy. The HOL pair Jones, B. Tim Denvir, and Roger library. In The HOL System, C. F. Shaw, editors, Proceedings volume Libraries. SRI Interna- of the 5th Refinement Workshop, tional, Cambridge Research Cen- Workshops in Computing, pages ter, Millers Yard, Mill Lane, 230–254. BCS-FACS, Springer- Cambridge CB2 1RQ, England, Verlag, Lloyd’s Register, London, 2.01 edition, July 1991. January 1992. Grundy:1991:HWL Grundy:1993:MPR [Gru91b] Jim Grundy. The HOL win- [Gru93a] Jim Grundy. A Method of Pro- dow library. In The HOL Sys- gram Refinement. Phd thesis, tem, volume Libraries. SRI In- technical report 318, Computer ternational, Cambridge Research Laboratory, University of Cam- Center, Millers Yard, Mill Lane, bridge, New Museums Site, Pem- Cambridge CB2 1RQ, England, broke Street, Cambridge CB2 2.01 edition, July 1991. 3QG, England, November 1993. Grundy:1991:RME Grundy:1993:PPS [Gru91c] Jim Grundy. Report on m- [Gru93b] Jim Grundy. Predicative pro- EVES. ERL Research Re- gramming — A survey. In Dines port ERL-0545-RR, Information Bjørner, Manfred Broy, and REFERENCES 4

Igor V. Pottosin, editors, Formal Computer Journal, 39(4):291– Methods in Programming and 302, May 1996. CODEN CM- Their Applications: Proceedings PJA6. ISSN 0010-4620 (print), of the International Conference, 1460-2067 (electronic). volume 735 of Lecture Notes in Computer Science, pages 8– Grundy:1996:TSE 25. Springer-Verlag, Novosibirsk, [Gru96d] Jim Grundy. Trustworthy stor- Russia, June 1993. age and exchange of theorems. Grundy:1993:TVL TUCS Technical Report 1, Turku Centre for Computer Science, [Gru93c] Jim Grundy. A three-valued logic Lemmink¨aisenkatu 14, FIN- for refinement. In Dines Bjørner, 20520 Turku, Finland, April Manfred Broy, and Igor V. Pot- 1996. tosin, editors, Formal Methods in Wright:1996:SPI Programming and Their Appli- cations: Proceedings of the In- [vWGH96a] Joakim von Wright, Jim Grundy, ternational Conference, volume and John Harrison, editors. Sup- 735 of Lecture Notes in Computer plementary Proceedings of the Science, pages 26–42. Springer- 9th International Conference on Verlag, Novosibirsk, Russia, June Theorem Proving in Higher Or- 1993. der Logics: TPHOLs’96, num- Grundy:1996:ABF ber 1 in TUCS General Publi- cations. Turku Centre for Com- [Gru96a] Jim Grundy. A browsable format puter Science, Turku, Finland, for proof presentation. Mathesis August 1996. ISBN 951-650-781- Universalis, 1(2), Spring 1996. 6. ISSN 1239-1905. Grundy:1996:BFP Wright:1996:TPH [Gru96b] Jim Grundy. A browsable for- [vWGH96b] Joakim von Wright, Jim Grundy, mat for proof presentation. In and John Harrison, editors. The- Christoffer Gefwert, Pekka Or- orem proving in higher order log- ponen, and Jouko Sepp¨anen, ed- ics: 9th International Confer- itors, Logic, Mathematics and ence, TPHOLs’96, Turku, Fin- the Computer — Foundations: land, August 26–30, 1996: pro- History, Philosophy and Appli- ceedings, volume 1125 of Lec- cations, volume 14 of Sym- ture Notes in Computer Science. posium Series, pages 171–178. Springer-Verlag, Berlin, 1996. Finnish Artificial Intelligence So- CODEN LNCSD9. ISBN 3-540- ciety, Helsinki, Finland, June 61587-3. ISSN 0302-9743 (print), 1996. 1611-3349 (electronic). LCCN Grundy:1996:THR QA76.9.A96I577 1996. [Gru96c] Jim Grundy. Transformational hierarchical reasoning. The