{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:16:49Z","timestamp":1725560209124},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540280057"},{"type":"electronic","value":"9783540318644"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11532231_3","type":"book-chapter","created":{"date-parts":[[2010,7,21]],"date-time":"2010-07-21T14:56:52Z","timestamp":1279724212000},"page":"23-37","source":"Crossref","is-referenced-by-count":1,"title":["Reasoning in Extensional Type Theory with Equality"],"prefix":"10.1007","author":[{"given":"Chad E.","family":"Brown","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","first-page":"345","DOI":"10.4064\/fm-52-3-345-350","volume":"52","author":"P.B. Andrews","year":"1963","unstructured":"Andrews, P.B.: A reduction of the axioms for the theory of propositional types. Fundamenta Mathematicae\u00a052, 345\u2013350 (1963)","journal-title":"Fundamenta Mathematicae"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"414","DOI":"10.2307\/2269949","volume":"36","author":"P.B. Andrews","year":"1971","unstructured":"Andrews, P.B.: Resolution in type theory. Journal of Symbolic Logic\u00a036, 414\u2013432 (1971)","journal-title":"Journal of Symbolic Logic"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/BF00248320","volume":"5","author":"P.B. Andrews","year":"1989","unstructured":"Andrews, P.B.: On connections and higher-order logic. Journal of Automated Reasoning\u00a05, 257\u2013291 (1989)","journal-title":"Journal of Automated Reasoning"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1016\/B978-044450813-3\/50017-5","volume-title":"Handbook of Automated Reasoning, ch. 15","author":"P.B. Andrews","year":"2001","unstructured":"Andrews, P.B.: Classical type theory. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, ch. 15, vol.\u00a02, pp. 965\u20131007. Elsevier Science, Amsterdam (2001)"},{"key":"3_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-015-9934-4","volume-title":"An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof","author":"P.B. Andrews","year":"2002","unstructured":"Andrews, P.B.: An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof, 2nd edn. Kluwer Academic Publishers, Dordrecht (2002)","edition":"2"},{"key":"3_CR6","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":"3_CR7","unstructured":"Benzm\u00fcller, C.: Equality and Extensionality in Automated Higher-Order Theorem Proving. PhD thesis, Universit\u00e4t des Saarlandes (1999)"},{"key":"3_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BFb0054256","volume-title":"Automated Deduction - CADE-15","author":"C. Benzm\u00fcller","year":"1998","unstructured":"Benzm\u00fcller, C., Kohlhase, M.: System description: LEO - A higher-order theorem prover. In: Kirchner, C., Kirchner, H. (eds.) CADE 1998. LNCS (LNAI), vol.\u00a01421, pp. 139\u2013143. Springer, Heidelberg (1998)"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/BF00881869","volume":"11","author":"W.W. Bledsoe","year":"1993","unstructured":"Bledsoe, W.W., Feng, G.: Set-Var. Journal of Automated Reasoning\u00a011, 293\u2013314 (1993)","journal-title":"Journal of Automated Reasoning"},{"key":"3_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1007\/3-540-45620-1_33","volume-title":"Automated Deduction - CADE-18","author":"C.E. Brown","year":"2002","unstructured":"Brown, C.E.: Solving for set variables in higher-order theorem proving. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol.\u00a02392, pp. 408\u2013422. Springer, Heidelberg (2002)"},{"key":"3_CR11","unstructured":"Brown, C.E.: Set Comprehension in Church\u2019s Type Theory. PhD thesis, Department of Mathematical Sciences, Carnegie Mellon University (2004)"},{"key":"3_CR12","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":"3_CR13","doi-asserted-by":"crossref","first-page":"323","DOI":"10.4064\/fm-52-3-323-344","volume":"52","author":"L. Henkin","year":"1963","unstructured":"Henkin, L.: A theory of propositional types. Fundamenta Mathematicae\u00a052, 323\u2013344 (1963)","journal-title":"Fundamenta Mathematicae"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0304-3975(75)90011-0","volume":"1","author":"G.P. Huet","year":"1975","unstructured":"Huet, G.P.: A unification algorithm for typed \u03bb-calculus. Theoretical Computer Science\u00a01, 27\u201357 (1975)","journal-title":"Theoretical Computer Science"},{"key":"3_CR15","unstructured":"Miller, D.A.: Proofs in Higher-Order Logic. PhD thesis, Carnegie Mellon University, 81 pp (1983)"},{"issue":"4","key":"3_CR16","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":"3_CR17","unstructured":"Pfenning, F.: Proof Transformations in Higher-Order Logic. PhD thesis, Carnegie Mellon University, 156 pp (1987)"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction \u2013 CADE-20"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11532231_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:09:13Z","timestamp":1605625753000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11532231_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540280057","9783540318644"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11532231_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}