Download Tps3 Programmer`s Guide Peter B. Andrews Dan
Transcript
Bibliography [ABB00] Peter B. Andrews, Matthew Bishop, and Chad E. Brown. System description: Tps: A theorem proving system for type theory. In David McAllester, editor, Proceedings of the 17th International Conference on Automated Deduction, volume 1831 of Lecture Notes in Artificial Intelligence, pages 164–169, Pittsburgh, PA, USA, 2000. Springer-Verlag. http://dx.doi.org/10.1007/10721959 11. [ABI+ 96] Peter B. Andrews, Matthew Bishop, Sunil Issar, Dan Nesmith, Frank Pfenning, and Hongwei Xi. TPS: A theorem proving system for classical type theory. Journal of Automated Reasoning, 16:321–353, 1996. Reprinted in [BBSS08]. http://dx.doi.org/10.1007/BF00252180. [And89] Peter B. Andrews. On connections and higher-order logic. Journal of Automated Reasoning, 5:257–291, 1989. Reprinted in [BBSS08]. [And01] Peter B. Andrews. Classical type theory. In Alan Robinson and Andrei Voronkov, editors, Handbook of Automated Reasoning, volume 2, chapter 15, pages 965–1007. Elsevier Science, 2001. [BA98] Matthew Bishop and Peter B. Andrews. Selectively instantiating definitions. In Claude Kirchner and Hélène Kirchner, editors, Proceedings of the 15th International Conference on Automated Deduction, volume 1421 of Lecture Notes in Artificial Intelligence, pages 365–380, Lindau, Germany, 1998. Springer-Verlag. http://dx.doi.org/10.1007/BFb0054272. [BBP93] Sidney C. Bailin and Dave Barker-Plummer. Z-match: An inference rule for incrementally elaborating set instantiations. Journal of Automated Reasoning, 11:391–428, 1993. Errata: JAR 12 (1994), 411–412. [BBSS08] Christoph Benzmüller, Chad E. Brown, Jörg Siekmann, and Richard Statman, editors. Reasoning in Simple Type Theory. Festschrift in Honour of Peter B. Andrews on his 70th Birthday. College Publications, King’s College London, 2008. Reviewed in Bulletin of Symbolic Logic 16 (3), September 2010, 409-411. http://www.collegepublications.co.uk/logic/mlf/?00010. [BF93] W. W. Bledsoe and Guohui Feng. Set-Var. Journal of Automated Reasoning, 11:293–314, 1993. [Bis99] Matthew Bishop. Mating Search Without Path Enumeration. PhD thesis, Department of Mathematical Sciences, Carnegie Mellon University, April 1999. Department of Mathematical Sciences Research Report No. 99–223. [Ble77] W. W. Bledsoe. Set variables. In Proceedings of the 5th International Joint Conference on Artificial Intelligence, IJCAI-77, pages 501–510, MIT, Cambridge, MA, 1977. IJCAI. [Ble79] W. W. Bledsoe. A maximal method for set variables in automatic theorem proving. In J. E. Hayes, Donald Michie, and L. I. Mikulich, editors, Machine Intelligence 9, pages 53–100. Ellis Harwood Ltd., Chichester, and John Wiley & Sons, 1979. 251