{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T02:32:27Z","timestamp":1768444347357,"version":"3.49.0"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030988685","type":"print"},{"value":"9783030988692","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-98869-2_2","type":"book-chapter","created":{"date-parts":[[2022,3,12]],"date-time":"2022-03-12T08:05:48Z","timestamp":1647072348000},"page":"16-37","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Data Type Inference for\u00a0Logic Programming"],"prefix":"10.1007","author":[{"given":"Jo\u00e3o","family":"Barbosa","sequence":"first","affiliation":[]},{"given":"M\u00e1rio","family":"Florido","sequence":"additional","affiliation":[]},{"given":"V\u00edtor Santos","family":"Costa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,13]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Barbosa, J., Florido, M., Costa, V.S.: A three-valued semantics for typed logic programming. In: Proceedings 35th International Conference on Logic Programming (Technical Communications), ICLP 2019 Technical Communications, Las Cruces, NM, USA, 20\u201325 September 2019. EPTCS, vol. 306, pp. 36\u201351 (2019)","DOI":"10.4204\/EPTCS.306.10"},{"key":"2_CR2","unstructured":"Barbosa, J., Florido, M., Costa, V.S.: Closed types for logic programming. In: 25th International Workshop on Functional and Logic Programming (WFLP 2017) (2017)"},{"issue":"3","key":"2_CR3","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0167-6423(92)90038-D","volume":"19","author":"R Barbuti","year":"1992","unstructured":"Barbuti, R., Giacobazzi, R.: A bottom-up polymorphic type inference in logic programming. Sci. Comput. Program. 19(3), 281\u2013313 (1992)","journal-title":"Sci. Comput. Program."},{"key":"2_CR4","unstructured":"Bruynooghe, M., Janssens, G.: An instance of abstract interpretation integrating type and mode inferencing. In: 1988 Fifth International Conference and Symposium, Washington, pp. 669\u2013683 (1988)"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/3-540-49727-7_17","volume-title":"Static Analysis","author":"W Charatonik","year":"1998","unstructured":"Charatonik, W., Podelski, A.: Directional type inference for logic programs. In: Levi, G. (ed.) SAS 1998. LNCS, vol. 1503, pp. 278\u2013294. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-49727-7_17"},{"key":"2_CR6","unstructured":"Damas, L.: Type assignment in programming languages. Ph.D. thesis, University of Edinburgh, UK (1984)"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/10722311_5","volume-title":"Analysis and Visualization Tools for Constraint Programming","author":"W Drabent","year":"2000","unstructured":"Drabent, W., Ma\u0142uszy\u0144ski, J., Pietrzak, P.: Locating type errors in untyped CLP programs. In: Deransart, P., Hermenegildo, M.V., Ma\u0142uszynski, J. (eds.) Analysis and Visualization Tools for Constraint Programming. LNCS, vol. 1870, pp. 121\u2013150. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10722311_5"},{"issue":"4\u20135","key":"2_CR8","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1017\/S1471068402001473","volume":"2","author":"W Drabent","year":"2002","unstructured":"Drabent, W., Ma\u0142uszy\u0144ski, J., Pietrzak, P.: Using parametric set constraints for locating errors in CLP programs. Theory Pract. Logic Program. 2(4\u20135), 549\u2013610 (2002)","journal-title":"Theory Pract. Logic Program."},{"key":"2_CR9","unstructured":"Dart, P.W., Zobel, J.: A regular type language for logic programs. In: Pfenning, F. (ed.) Types in Logic Programming, pp. 157\u2013187. The MIT Press (1992)"},{"key":"2_CR10","unstructured":"Florido, M., Damas, L.: Types as theories. In: Proceedings of post-conference workshop on Proofs and Types, Joint International Conference and Symposium on Logic Programming (1992)"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Fr\u00fchwirth, T.W., Shapiro, E.Y., Vardi, M.Y., Yardeni, E.: Logic programs as types for logic programs. In: 1991 Proceedings of the Sixth Annual Symposium on Logic in Computer Science (LICS 1991), Netherlands, pp. 300\u2013309 (1991)","DOI":"10.1109\/LICS.1991.151654"},{"key":"2_CR12","unstructured":"Gallagher, J.P., de Waal, D.A.: Fast and precise regular approximations of logic programs. In: 1994 Logic Programming, International Conference on Logic Programming, Italy, pp. 599\u2013613 (1994)"},{"key":"2_CR13","unstructured":"Hanus, M.: Polymorphic high-order programming in prolog. In: Levi, G., Martelli, M. (eds.) Logic Programming, Proceedings of the Sixth International Conference, Lisbon, Portugal, 19\u201323 June 1989, pp. 382\u2013397. MIT Press (1989)"},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-642-37651-1_6","volume-title":"Programming Logics","author":"M Hanus","year":"2013","unstructured":"Hanus, M.: Functional logic programming: from theory to curry. In: Voronkov, A., Weidenbach, C. (eds.) Programming Logics. LNCS, vol. 7797, pp. 123\u2013168. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37651-1_6"},{"issue":"2","key":"2_CR15","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1145\/169701.169692","volume":"15","author":"F Henglein","year":"1993","unstructured":"Henglein, F.: Type inference with polymorphic recursion. ACM Trans. Program. Lang. Syst. 15(2), 253\u2013289 (1993)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"2_CR16","unstructured":"Heintze, N., Jaffar, J.: Semantic types for logic programs. In: Pfenning, F. (ed.) Types in Logic Programming, pp. 141\u2013155. The MIT Press (1992)"},{"key":"2_CR17","volume-title":"The G\u00f6del Programming Language","author":"PM Hill","year":"1994","unstructured":"Hill, P.M., Lloyd, J.W.: The G\u00f6del Programming Language. MIT Press, Cambridge (1994)"},{"key":"2_CR18","unstructured":"Lakshman, T.L., Reddy, U.S.: Typed Prolog: a semantic reconstruction of the Mycroft-O\u2019Keefe type system. In Logic Programming, Proceedings of the 1991 International Symposium, San Diego, California, USA (1991)"},{"issue":"9","key":"2_CR19","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1145\/609769.609782","volume":"36","author":"L Lunjin","year":"2001","unstructured":"Lunjin, L.: On Dart-Zobel algorithm for testing regular type inclusion. SIGPLAN Not. 36(9), 81\u201385 (2001)","journal-title":"SIGPLAN Not."},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Maher, M.: Complete axiomatizations of the algebras of finite, rational and infinite trees. In: Proceedings Third Annual Symposium on Logic in Computer Science, Los Alamitos, CA, USA, pp. 348\u2013357. IEEE Computer Society, July 1988","DOI":"10.1109\/LICS.1988.5132"},{"key":"2_CR21","unstructured":"Mishra, P.: Towards a theory of types in Prolog. In: Proceedings of the 1984 International Symposium on Logic Programming, Atlantic City, New Jersey, USA, 6\u20139 February 1984, pp. 289\u2013298. IEEE-CS (1984)"},{"issue":"3","key":"2_CR22","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/0004-3702(84)90017-1","volume":"23","author":"A Mycroft","year":"1984","unstructured":"Mycroft, A., O\u2019Keefe, R.A.: A polymorphic type system for Prolog. Artif. Intell. 23(3), 295\u2013307 (1984)","journal-title":"Artif. Intell."},{"key":"2_CR23","unstructured":"Naish, L.: Types and the intended meaning of logic programs. In: Pfenning, F. (ed.) Types in Logic Programming, pp. 189\u2013216. The MIT Press (1992)"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Pietrzak, P., Correas, J., Puebla, G., Hermenegildo, M.V.: A practical type analysis for verification of modular Prolog programs. In: Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pp. 61\u201370, January 2008","DOI":"10.1145\/1328408.1328418"},{"key":"2_CR25","unstructured":"Pyo, C., Reddy, U.S.: Inference of polymorphic types for logic programs. In: 1989 Proceedings of the North American Conference on Logic Programming, USA, 2 Volumes, pp. 1115\u20131132 (1989)"},{"key":"2_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-642-00515-2_11","volume-title":"Logic-Based Program Synthesis and Transformation","author":"T Schrijvers","year":"2009","unstructured":"Schrijvers, T., Bruynooghe, M., Gallagher, J.P.: From monomorphic to polymorphic well-typings and beyond. In: Hanus, M. (ed.) LOPSTR 2008. LNCS, vol. 5438, pp. 152\u2013167. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00515-2_11"},{"key":"2_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/978-3-540-89982-2_59","volume-title":"Logic Programming","author":"T Schrijvers","year":"2008","unstructured":"Schrijvers, T., Santos Costa, V., Wielemaker, J., Demoen, B.: Towards typed Prolog. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol. 5366, pp. 693\u2013697. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-89982-2_59"},{"key":"2_CR28","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/BFb0026840","volume-title":"Programming Languages: Implementations, Logics and Programs","author":"H Sa\u011flam","year":"1995","unstructured":"Sa\u011flam, H., Gallagher, J.P.: Approximating constraint logic programs using polymorphic types and regular descriptions. In: Hermenegildo, M., Swierstra, S.D. (eds.) Programming Languages: Implementations, Logics and Programs, pp. 461\u2013462. Springer, Heidelberg (1995)"},{"issue":"1\u20133","key":"2_CR29","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0743-1066(96)00068-4","volume":"29","author":"Z Somogyi","year":"1996","unstructured":"Somogyi, Z., Henderson, F., Conway, T.C.: The execution algorithm of Mercury, an efficient purely declarative logic programming language. J. Log. Program. 29(1\u20133), 17\u201364 (1996)","journal-title":"J. Log. Program."},{"key":"2_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BFb0032738","volume-title":"Static Analysis","author":"JM Talbot","year":"1997","unstructured":"Talbot, J.M., Tison, S., Devienne, P.: Set-based analysis for logic programming and tree automata. In: Van Hentenryck, P. (ed.) SAS 1997. LNCS, vol. 1302, pp. 127\u2013140. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0032738"},{"key":"2_CR31","unstructured":"Ullman, J.D.: Principles of Database and Knowledge-Base Systems, Computer Science Press Inc. (1988)"},{"key":"2_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/3-540-45789-5_10","volume-title":"Static Analysis","author":"C Vaucheret","year":"2002","unstructured":"Vaucheret, C., Bueno, F.: More precise yet efficient type inference for logic programs. In: Hermenegildo, M.V., Puebla, G. (eds.) SAS 2002. LNCS, vol. 2477, pp. 102\u2013116. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45789-5_10"},{"key":"2_CR33","unstructured":"Van Roy, P.L.: Can logic programming execute as fast as imperative programming? Ph.D. thesis, EECS Department, University of California, Berkeley, November 1990"},{"key":"2_CR34","unstructured":"Yardeni, E., Fr\u00fchwirth, T.W., Shapiro, E.: Polymorphically typed logic programs. In: Pfenning, F. (ed.) Types in Logic Programming, pp. 63\u201390. The MIT Press (1992)"},{"key":"2_CR35","unstructured":"Zobel, J.: Derivation of polymorphic types for Prolog programs. In: 1987 Proceedings of the Fourth International Conference on Logic Programming, Melbourne (1987)"}],"container-title":["Lecture Notes in Computer Science","Logic-Based Program Synthesis and Transformation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-98869-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,20]],"date-time":"2024-09-20T04:26:12Z","timestamp":1726806372000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-98869-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030988685","9783030988692"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-98869-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"13 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LOPSTR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Logic-Based Program Synthesis and Transformation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tallinn","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Estonia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lopstr2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/saks.iasi.cnr.it\/lopstr21\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"53% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1 Invited talk is also included in the proceedings.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}