{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:16:12Z","timestamp":1725664572330},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540587927"},{"type":"electronic","value":"9783540491040"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58792-6_9","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:46:14Z","timestamp":1330274774000},"page":"138-153","source":"Crossref","is-referenced-by-count":2,"title":["Schema-based top-down design of logic programs using abstract data types"],"prefix":"10.1007","author":[{"given":"E.","family":"Marakakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. P.","family":"Gallagher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"9_CR1","unstructured":"A. Aho, J. Hopcroft and J. Ullman, Data Structures and Algorithms, Addison-Wesley, 1983."},{"key":"9_CR2","unstructured":"D. Barker-Plummer, Clich\u00e9 Programming in Prolog, Proceedings of the Second Workshop on Meta-programming in Logic, (ed. M. Bruynooghe); April 1990, Belgium, pp.247\u2013256."},{"key":"9_CR3","unstructured":"M. Bruynooghe, Adding Redundancy to Obtain More Reliable and More Readable Prolog Programs, Proceedings of the First International Logic Programming Conference, Sept. 1982, Marseille, France, pp.129\u2013133."},{"key":"9_CR4","unstructured":"S. Debray, D. Warren, Automatic Mode Inference for Prolog Programs, Proceedings of the Symposium on Logic Programming, Salt Lake City, Utah, Sept. 1986, pp.78\u201388."},{"key":"9_CR5","unstructured":"Y. Deville, J. Burnay, Generalization and Program Schemata: A Step Towards Computer-Aided Construction of Logic Programs, Proc. of the North American Conference on Logic Programming, 1989, (eds. E. Lusk and R. Overbeek); pp.409\u2013425, vol. I."},{"key":"9_CR6","unstructured":"Y. Deville, Logic Programming: Systematic Program Development, Addison-Wesley, 1990."},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"R. Dietrich, F. Hagl, A Polymorphic Type System with Subtypes for Prolog, ESOP'88 Proceedings of the 2nd European Symposium on Programming, Nancy, France 1988, Lecture Notes in Comp. Sc. no 300, pp.79\u201393.","DOI":"10.1007\/3-540-19027-9_6"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Pierre Flener, Yves Deville, Towards Stepwise, Schema-Guided Synthesis of Logic Programs, Proceedings of International Workshop on Logic Program Synthesis and Transformation, LOPSTR'91, Manchester, U.K., 1991, pp.46\u201364.","DOI":"10.1007\/978-1-4471-3494-7_4"},{"key":"9_CR9","volume-title":"Technical Report, CS-1989-20","author":"T. Gegg-Harrison","year":"1989","unstructured":"T. Gegg-Harrison, Basic Prolog Schemata, Technical Report, CS-1989-20, Dept. of Computer Science, Duke University, Durham, North Carolina, Sept. 1989."},{"key":"9_CR10","unstructured":"P. Hill, and R. Topor, A Semantics for Typed Logic Programs, Chapter 1 in Types in Logic Programming edited by F. Pfenning, The MIT Press, 1992."},{"key":"9_CR11","unstructured":"P. Hill, J. Lloyd, The G\u00f6del Programming Language, The MIT Press, 1994."},{"key":"9_CR12","unstructured":"A. Lakhotia, A Workbench for Developing Logic Programs by Stepwise Enhancement, PhD thesis, Case Western Reverse University, Department of Computer Engineering and Science, Aug. 1989."},{"key":"9_CR13","unstructured":"J. Kingston, Algorithms and Data Structures, Design, Correctness, Analysis, Addison-Wesley, 1990."},{"key":"9_CR14","unstructured":"J. Komorowski, Towards a Programming Methodology Founded on Partial Deduction, Proc. of the European Conference on Artificial Intelligence, Stockholm, Sweden, August 1990."},{"key":"9_CR15","unstructured":"E. Marakakis, J.P. Gallagher, Schema-Based Top-Down Design of Logic Programs Using Abstract Data Types, Technical Report, CSTR-94-02, University of Bristol, Department of Computer Science."},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0743-1066(85)90004-4","volume":"1","author":"C. Mellish","year":"1985","unstructured":"C. Mellish, Some Global Optimizations for a Prolog Compiler, Journal of Logic Programming, 1, 1985, pp. 43\u201366.","journal-title":"Journal of Logic Programming"},{"key":"9_CR17","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0004-3702(84)90017-1","volume":"23","author":"A. Mycroft","year":"1984","unstructured":"A. Mycroft, R. O'Keefe, A Polymorphic System for Prolog, Artificial Intelligence, 23, 1984, pp. 295\u2013307.","journal-title":"Artificial Intelligence"},{"key":"9_CR18","first-page":"153","volume":"5","author":"G. Plotkin","year":"1970","unstructured":"G. Plotkin, A Note on Inductive Generalization, Machine Intelligence, 5, 1970, pp. 153\u2013163.","journal-title":"Machine Intelligence"},{"key":"9_CR19","unstructured":"D. Robertson, A Simple Prolog Techniques Editor for Novice Users, Proceedings of the 3rd Annual Conference on Logic Programming, Edinburgh, April 1991, pp.78\u201385."},{"key":"9_CR20","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0004-3702(85)90083-9","volume":"27","author":"D. Smith","year":"1985","unstructured":"D. Smith, Top-Down Synthesis of Divide-and-Conquer Algorithms, Artificial Intelligence, vol. 27, 1985, pp. 43\u201396.","journal-title":"Artificial Intelligence"},{"key":"9_CR21","unstructured":"L. Sterling, M. Kirschenbaum, Applying Techniques to Skeletons, Chapter 6 in Constructing Logic Programs edited by Jean-Marie Jacquet, Wiley, 1993."},{"key":"9_CR22","unstructured":"N. Tinkham, Induction of Schemata for Program Synthesis, PhD thesis, Department of Computer Science, Duke University, 1990."},{"key":"9_CR23","unstructured":"N. Wirth, Algorithms + Data Structures = Programs, Prentice-Hall, 1976."},{"key":"9_CR24","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF03037409","volume":"No.4","author":"T. Yokomori","year":"1986","unstructured":"T. Yokomori, Logic Program Forms, New Generation Computing, No.4, 1986, pp. 305\u2013319.","journal-title":"New Generation Computing"}],"container-title":["Lecture Notes in Computer Science","Logic Program Synthesis and Transformation \u2014 Meta-Programming in Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58792-6_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:24:12Z","timestamp":1605648252000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58792-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540587927","9783540491040"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-58792-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}