{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:06:16Z","timestamp":1725663976682},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540573708"},{"type":"electronic","value":"9783540480969"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57370-4_38","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T07:56:46Z","timestamp":1330243006000},"page":"73-86","source":"Crossref","is-referenced-by-count":1,"title":["A typed \u03bb-calculus for proving-by-example and bottom-up generalization procedure"],"prefix":"10.1007","author":[{"given":"Masami","family":"Hagiya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"issue":"No.2","key":"6_CR1","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1017\/S0956796800020025","volume":"1","author":"H. Barendregt","year":"1991","unstructured":"Barendregt,H.: Introduction to generalized type systems, Journal of Functional Programming, Vol.1, No.2 (1991), pp.125\u2013154.","journal-title":"Journal of Functional Programming"},{"key":"6_CR2","unstructured":"Bledsoe.W.W.: A new method for proving certain Presburger formulas, Proceedings of IJCAI, 1975, pp.15\u201321."},{"key":"6_CR3","unstructured":"Bruynooghe. M., De Raedt, L., De Schreye, D.: Explanation based program transformation, Proceedings of IJCAI, 1989, pp.407\u2013412."},{"issue":"No.7","key":"6_CR4","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1145\/79204.79209","volume":"33","author":"J. Cohen","year":"1990","unstructured":"Cohen,J.: Constraint logic programming languages, Communications of the ACM, Vol.33, No.7 (1990), pp.52\u201368.","journal-title":"Communications of the ACM"},{"key":"6_CR5","first-page":"91","volume":"No.7","author":"D.C. Cooper","year":"1972","unstructured":"Cooper,D.C.: Theorem proving in arithmetic without multiplication, Machine Intelligence, No.7 (1972), pp.91\u201399.","journal-title":"Machine Intelligence"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Coquand,T.: An algorithm for testing conversion in type theory, Logical Framework (Huet,G., Plotkin,G., eds.), 1991, pp.255\u2013279.","DOI":"10.1017\/CBO9780511569807.011"},{"issue":"No.2","key":"6_CR7","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1145\/66443.66445","volume":"21","author":"T. Ellman","year":"1989","unstructured":"Ellman,T.: Explanation-based learning: A survey of programs and perspectives, ACM Computing Surveys, Vol.21, No.2 (1989), pp.163\u2013221.","journal-title":"ACM Computing Surveys"},{"key":"6_CR8","unstructured":"Harper,R., Honsell,F., Plotkin,G.: A framework for defining logics, Symposium on Logic in Computer Science, 1987, pp.194\u2013204."},{"key":"6_CR9","unstructured":"Harper,R.: An equational formulation of LF, ECS-LFCS-88-67, Edinburgh, 1988."},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Hagiya,M.: Programming by example and proving by example using higher-order unification, 10th International Conference on Automated Deduction (Stickel, M., ed.), Lecture Notes in Artificial Intelligence, Vol.449 (1990), pp.588\u2013602.","DOI":"10.1007\/3-540-52885-7_116"},{"key":"6_CR11","unstructured":"Hagiya, M.: From programming-by-example to proving-by-example, Theoretical Aspects of Computer Software (Ito, T., Meyer, A.R., eds.), Lecture Notes in Computer Science, Vol.526 (1991), pp.387\u2013419."},{"key":"6_CR12","unstructured":"Shavlik,J.W., DeJong,G.F.: An explanation-based approach to generalizing number, Proceedings of IJCAI, 1987, pp.236\u2013238."},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Shavlik,J.W., DeJong.G.F.: Acquiring general iterative concepts by reformulating explanations of observed examples, Machine Learning Volume III (Kodratoff,Y., Michalski, R., eds.), 1990, pp.302\u2013350.","DOI":"10.1016\/B978-0-08-051055-2.50018-3"},{"issue":"No.4","key":"6_CR14","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1145\/322033.322034","volume":"24","author":"R.E. Shostak","year":"1977","unstructured":"Shostak,R.E.: On the SUP-INF method for proving Presburger formulas, Journal of the ACM, Vol.24, No.4 (1977), pp.529\u2013543.","journal-title":"Journal of the ACM"},{"key":"6_CR15","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0747-7171(89)80045-8","volume":"7","author":"M.H. Takahashi","year":"1989","unstructured":"Takahashi,M.H.: Parallel reductions in \u03bb-calculus, Journal of Symbolic Computation, Vol.7 (1989), pp.113\u2013123.","journal-title":"Journal of Symbolic Computation"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57370-4_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:12:06Z","timestamp":1605629526000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57370-4_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540573708","9783540480969"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-57370-4_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}