{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:49:56Z","timestamp":1725475796115},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540676645"},{"type":"electronic","value":"9783540451013"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/10721959_11","type":"book-chapter","created":{"date-parts":[[2006,12,29]],"date-time":"2006-12-29T21:12:31Z","timestamp":1167426751000},"page":"164-169","source":"Crossref","is-referenced-by-count":9,"title":["System Description: TPS: A Theorem Proving System for Type Theory"],"prefix":"10.1007","author":[{"given":"Peter B.","family":"Andrews","sequence":"first","affiliation":[]},{"given":"Matthew","family":"Bishop","sequence":"additional","affiliation":[]},{"given":"Chad E.","family":"Brown","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1145\/322248.322249","volume":"28","author":"P.B. Andrews","year":"1981","unstructured":"Andrews, P.B.: Theorem Proving via General Matings. Journal of the ACM\u00a028, 193\u2013214 (1981)","journal-title":"Journal of the ACM"},{"key":"11_CR2","volume-title":"An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof","author":"P.B. Andrews","year":"1986","unstructured":"Andrews, P.B.: An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof. Academic Press, London (1986)"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF00252180","volume":"16","author":"P.B. Andrews","year":"1996","unstructured":"Andrews, P.B., Bishop, M., Issar, S., Nesmith, D., Pfenning, F., Xi, H.: TPS: A Theorem Proving System for Classical Type Theory. Journal of Automated Reasoning\u00a016, 321\u2013353 (1996)","journal-title":"Journal of Automated Reasoning"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Bibel, W.: Automated Theorem Proving, 2nd edn. Vieweg, Braunschweig (1987)","DOI":"10.1007\/978-3-322-90102-6"},{"key":"11_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/3-540-48660-7_32","volume-title":"Automated Deduction - CADE-16","author":"M. Bishop","year":"1999","unstructured":"Bishop, M.: A Breadth-First Strategy for Mating Search. In: Ganzinger, H. (ed.) CADE 1999. LNCS (LNAI), vol.\u00a01632, pp. 359\u2013373. Springer, Heidelberg (1999)"},{"key":"11_CR6","unstructured":"Bishop, M.: 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, Available at \n                    \n                      http:\/\/gtps.math.cmu.edu\/tps.html"},{"key":"11_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BFb0054272","volume-title":"Automated Deduction - CADE-15","author":"M. Bishop","year":"1998","unstructured":"Bishop, M., Andrews, P.B.: Selectively Instantiating Definitions. In: Kirchner, C., Kirchner, H. (eds.) CADE 1998. LNCS (LNAI), vol.\u00a01421, pp. 365\u2013380. Springer, Heidelberg (1998)"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"56","DOI":"10.2307\/2266170","volume":"5","author":"A. Church","year":"1940","unstructured":"Church, A.: A Formulation of the Simple Theory of Types. Journal of Symbolic Logic\u00a05, 56\u201368 (1940)","journal-title":"Journal of Symbolic Logic"},{"key":"11_CR9","first-page":"221","volume-title":"AAAI-90","author":"S. Issar","year":"1990","unstructured":"Issar, S.: Path-Focused Duplication: A Search Procedure for General Matings. In: AAAI-90, vol.\u00a01, pp. 221\u2013226. AAAI Press, Menlo Park (1990)"},{"key":"11_CR10","unstructured":"Issar, S.: Operational Issues in Automated Theorem Proving Using Matings. PhD thesis. Carnegie Mellon University, 147 pff (1991)"},{"issue":"4","key":"11_CR11","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/BF00370646","volume":"46","author":"D.A. Miller","year":"1987","unstructured":"Miller, D.A.: A Compact Representation of Proofs. Studia Logica\u00a046(4), 347\u2013370 (1987)","journal-title":"Studia Logica"},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/BF00283132","volume":"17","author":"L. Paulson","year":"1996","unstructured":"Paulson, L., Grabczewski, K.: Mechanising Set Theory: Cardinal Arithmetic and the Axiom of Choice. Journal of Automated Reasoning\u00a017, 291\u2013323 (1996)","journal-title":"Journal of Automated Reasoning"},{"key":"11_CR13","unstructured":"Pfenning, F.: Proof Transformations in Higher-Order Logic. PhD thesis. Carnegie Mellon University, 156 pff (1987)"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1007\/3-540-52885-7_98","volume-title":"10th International Conference on Automated Deduction","author":"F. Pfenning","year":"1990","unstructured":"Pfenning, F., Nesmith, D.: Presenting Intuitive Deductions via Symmetric Simplification. In: Stickel, M.E. (ed.) CADE 1990. LNCS, vol.\u00a0449, pp. 336\u2013350. Springer, Heidelberg (1990)"},{"key":"11_CR15","volume-title":"Equivalents of the Axiom of Choice, II","author":"H. Rubin","year":"1985","unstructured":"Rubin, H., Rubin, J.E.: Equivalents of the Axiom of Choice, II. North- Holland, Amsterdam (1985)"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction - CADE-17"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10721959_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T10:37:40Z","timestamp":1553337460000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10721959_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540676645","9783540451013"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/10721959_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]}}}