{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:59:33Z","timestamp":1743008373159,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540646754"},{"type":"electronic","value":"9783540691105"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0054251","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T07:28:51Z","timestamp":1149665331000},"page":"103-118","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Unification in lambda-calculi with if-then-else"],"prefix":"10.1007","author":[{"given":"Michael","family":"Beeson","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,25]]},"reference":[{"key":"12_CR1","first-page":"463","volume-title":"A theorem prover for prioritized circumscription","author":"A. Baker","year":"1989","unstructured":"A. Baker and M. Ginsberg. A theorem prover for prioritized circumscription. Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, pp. 463\u2013467, Morgan Kaufmann, Los Altos, Calif. (1989)."},{"key":"12_CR2","volume-title":"The Lambda Calculus: Its Syntax and Semantics","author":"H. P. Barendregt","year":"1981","unstructured":"H. P. Barendregt. The Lambda Calculus: Its Syntax and Semantics. North-Holland, Amsterdam (1981)."},{"key":"12_CR3","series-title":"Lecture Notes in Artificial Intelligence 475","volume-title":"Extensions of Logic Programming","author":"M. Beeson","year":"1991","unstructured":"M. Beeson. Some applications of Gentzen's proof theory in automated deduction. In Schroeder-Heister (ed.), Extensions of Logic Programming, Lecture Notes in Artificial Intelligence 475, Springer-Verlag, Berlin\/Heidelberg\/New York (1991)."},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"M. Ginsberg. A circumscriptive theorem prover. Artificial Intelligence\n                        39, No. 2 (1989).","DOI":"10.1016\/0004-3702(89)90026-X"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0304-3975(75)90011-0","volume":"1","author":"G. Huet","year":"1975","unstructured":"G. Huet. A unification algorithm for typed \u03bb-calculus. Theoretical Computer Science\n                        1 (1975) 27\u201352.","journal-title":"Theoretical Computer Science"},{"key":"12_CR6","first-page":"121","volume-title":"Computing circumscription","author":"V. Lifschitz","year":"1985","unstructured":"V. Lifschitz. Computing circumscription. Proceedings of the Ninth International Joint Conference on Artificial Intelligence, pp. 121\u2013127, Morgan Kaufmann, Los Altos, Calif. (1985)."},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0004-3702(86)90032-9","volume":"28","author":"J. McCarthy","year":"1986","unstructured":"J. McCarthy. Applications of circumscription to formalizing common-sense knowledge. Artificial Intelligence\n                        28 (1986) 89\u2013116.","journal-title":"Artificial Intelligence"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0747-7171(92)90011-R","volume":"14","author":"D. Miller","year":"1992","unstructured":"D. Miller. Unification under a mixed prefix. Journal of Symbolic Computation\n                        14 (1992) 321\u2013358.","journal-title":"Journal of Symbolic Computation"},{"key":"12_CR9","unstructured":"D. Miller and G. Nadathur. An Overview of \u03bb-Prolog In Proceedings of the Fifth International Symposium on Logic Programming, Seattle, August 1988."},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"D. Prawitz. Completeness and Hauptsatz for second order logic. Theoria 33, 246\u2013258.","DOI":"10.1111\/j.1755-2567.1967.tb00622.x"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"W. Snyder. Higher-order E-unification. In M. E. Stickel (ed.), CADE-10, Tenth International Conference on Automated Deduction 573\u2013587 Springer-Verlag (1990).","DOI":"10.1007\/3-540-52885-7_115"},{"key":"12_CR12","unstructured":"Automated Deduction in Nonclassical Logics. MIT Press, Cambridge, MA (1990)"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction \u2014 CADE-15"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0054251","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T18:25:50Z","timestamp":1675189550000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BFb0054251"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540646754","9783540691105"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0054251","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"25 May 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}