{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:27:54Z","timestamp":1725456474418},"publisher-location":"Berlin\/Heidelberg","reference-count":14,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354057235X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0013166","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T07:23:18Z","timestamp":1132730598000},"page":"33-44","source":"Crossref","is-referenced-by-count":0,"title":["Analogical type theory"],"prefix":"10.1007","author":[{"given":"Bo","family":"Yi","sequence":"first","affiliation":[]},{"given":"Jiafu","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BF01887198","volume":"No 1","author":"R. C. Backhouse","year":"1989","unstructured":"Roland C. Backhouse, Paul Chisholm. Grant Malcolm and Erik Saaman, Doit-your-self type theory, Formal aspects of Computing, No 1, pp. 19\u201384, 1989.","journal-title":"Formal aspects of Computing"},{"key":"4_CR2","unstructured":"J. Carbonell, Derivational Analogy: A Theory of Reconstructive Problem Solving and Expertise Acquisition, in R. S. Michalski et al(ed.), Machine Intelligence: An Artificial Intelligence Approach, Morgan Kaufmann, 1986."},{"key":"4_CR3","first-page":"395","volume-title":"Machine Learning II: An Artificial Intelligence Approach","author":"N. Dershowitz","year":"1986","unstructured":"Dershowitz, N., Programming by Analogy, in: R. S. Michalski, J. G. Carbonell and T. M. Mitchell (Eds), Machine Learning II: An Artificial Intelligence Approach, Morgan Kaufmann, Los Altos, CA, 1986, pp. 395\u2013423."},{"key":"4_CR4","unstructured":"Dietzen, S. R. and W. L. Scherlis, Analogy in Program Development, in: The Role of Language in Problem Solving 2, J. C. Boudreaux, B. W. Hamill, and R. Jernigan(Eds), North-Holland, 1987, pp. 95\u2013115."},{"key":"4_CR5","volume-title":"To H. B. Curry: essay on conbinatory logic, \u03bb-calculus and formalism'","author":"W. A. Howard","year":"1980","unstructured":"W. A. Howard, The formulae-as-types notion of construction, in \u2018To H. B. Curry: essay on conbinatory logic, \u03bb-calculus and formalism', ed. Hindely J. R. and Selidin J. P., Academic Press, New York, 1980."},{"key":"4_CR6","unstructured":"George Polya, Induction and Analogy, Princeton Hall, 1957"},{"key":"4_CR7","unstructured":"Masateru, Harao, Analogical Reasoning for Natural Deduction Theorem Proving, in (Edited by Zhongzhi Shi) Automated Reasoning, IWAR 92 (Beijing' China) pp. 220\u2013228"},{"key":"4_CR8","unstructured":"Jianguo, Lu, Analogical Program Derivation Based on Type Theory, To appear in Theoretical Computer Science Vol.113."},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Per Martin-Lof, Constructive Mathematics and Computer Programming, in Logic, Methodology and Philosophy of Science, pp. 153\u2013175, North Holland, 1982.","DOI":"10.1016\/S0049-237X(09)70189-2"},{"key":"4_CR10","volume-title":"Programming in Mation-lof's Type Theory","author":"B. Nordstrom","year":"1990","unstructured":"Bengt Nordstrom, Kent Petersson and Jan M. Smith, Programming in Mation-lof's Type Theory, Clarendon Press (Oxford) 1990."},{"key":"4_CR11","unstructured":"Takeuti, G. Proof Theory, North-Holland, (2nd. edition), 1987."},{"key":"4_CR12","first-page":"1","volume":"No. 4","author":"Y. Bo","year":"1989","unstructured":"Bo, Yi and Jiafu, Xu, A Survey on Analogy Reasoning, Computer Science (in Chinese), 1989, No. 4, pp. 1\u20138","journal-title":"Computer Science (in Chinese)"},{"key":"4_CR13","unstructured":"Bo, Yi, Analogy Model and Analogy Correspondence:A Formal Theory on Analogy, Doctorial Thesis of Nanjing University, December 1989."},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Bo, Yi and Jiafu, Xu, Analogy Calculus, To appear in Theoretical Computer Science vol. 113, May 1993.","DOI":"10.1016\/0304-3975(93)90002-B"}],"container-title":["Lecture Notes in Computer Science","Design and Implementation of Symbolic Computation Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0013166","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:32:06Z","timestamp":1586579526000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/link.springer.com\/10.1007\/BFb0013166"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354057235X"],"references-count":14,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1007\/bfb0013166","relation":{},"subject":[]}}