{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:49:54Z","timestamp":1742971794429,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031167669"},{"type":"electronic","value":"9783031167676"}],"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-031-16767-6_7","type":"book-chapter","created":{"date-parts":[[2022,9,10]],"date-time":"2022-09-10T16:02:40Z","timestamp":1662825760000},"page":"123-141","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Typed SLD-Resolution: Dynamic Typing for\u00a0Logic Programming"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1817-7595","authenticated-orcid":false,"given":"Jo\u00e3o","family":"Barbosa","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0574-7555","authenticated-orcid":false,"given":"M\u00e1rio","family":"Florido","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3344-8237","authenticated-orcid":false,"given":"V\u00edtor Santos","family":"Costa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,11]]},"reference":[{"key":"7_CR1","volume-title":"From Logic Programming to Prolog","author":"KR Apt","year":"1996","unstructured":"Apt, K.R.: From Logic Programming to Prolog. Prentice-Hall Inc., Upper Saddle River (1996)"},{"key":"7_CR2","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":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-030-98869-2_2","volume-title":"Logic-Based Program Synthesis and Transformation","author":"J Barbosa","year":"2022","unstructured":"Barbosa, J., Florido, M., Costa, V.S.: Data type inference for logic programming. In: De Angelis, E., Vanhoof, W. (eds.) LOPSTR 2021. LNCS, pp. 16\u201337. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-98869-2_2"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Barbosa, J., Florido, M., Santos Costa, V.: Typed SLD-resolution: dynamic typing for logic programming. arXiv (2022)","DOI":"10.1007\/978-3-031-16767-6_7"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Beall, J.: Off-topic: a new interpretation of weak-kleene logic. Australas. J. Logic 13(6) (2016)","DOI":"10.26686\/ajl.v13i6.3976"},{"issue":"1\u20132","key":"7_CR6","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1080\/01445348108837023","volume":"2","author":"D Bochvar","year":"1981","unstructured":"Bochvar, D., Bergmann, M.: On a three-valued logical calculus and its application to the analysis of the paradoxes of the classical extended functional calculus. Hist. Philos. Logic 2(1\u20132), 87\u2013112 (1981)","journal-title":"Hist. Philos. Logic"},{"key":"7_CR7","unstructured":"Bruynooghe, M., Janssens, G.: An instance of abstract interpretation integrating type and mode inferencing. In: Fifth International Conference and Symposium, Washington, 1988, pp. 669\u2013683 (1988)"},{"issue":"1\u20132","key":"7_CR8","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1017\/S1471068411000512","volume":"12","author":"VS Costa","year":"2012","unstructured":"Costa, V.S., Rocha, R., Damas, L.: The YAP prolog system. Theor. Pract. Log. Program. 12(1\u20132), 5\u201334 (2012)","journal-title":"Theor. Pract. Log. Program."},{"key":"7_CR9","first-page":"157","volume-title":"Types in Logic Programming","author":"PW Dart","year":"1992","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, Cambridge (1992)"},{"key":"7_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-61411-8","volume-title":"Prolog - the Standard: Reference Manual","author":"P Deransart","year":"1996","unstructured":"Deransart, P., Ed-Dbali, A., Cervoni, L.: Prolog - the Standard: Reference Manual. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/978-3-642-61411-8"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/3-540-44716-4_18","volume-title":"Functional and Logic Programming","author":"P Deransart","year":"2001","unstructured":"Deransart, P., Smaus, J.-G.: Well-typed logic programs are not wrong. In: Kuchen, H., Ueda, K. (eds.) FLOPS 2001. LNCS, vol. 2024, pp. 280\u2013295. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44716-4_18"},{"issue":"4\u20135","key":"7_CR12","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. Theor. Pract. Logic Program. 2(4\u20135), 549\u2013610 (2002). https:\/\/doi.org\/10.1017\/S1471068402001473","journal-title":"Theor. Pract. Logic Program."},{"issue":"4","key":"7_CR13","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1145\/321978.321991","volume":"23","author":"MH van Emden","year":"1976","unstructured":"van Emden, M.H., Kowalski, R.A.: The semantics of predicate logic as a programming language. J. ACM 23(4), 733\u2013742 (1976)","journal-title":"J. ACM"},{"key":"7_CR14","unstructured":"Fr\u00fchwirth, T.W., Shapiro, E.Y., Vardi, M.Y., Yardeni, E.: Logic programs as types for logic programs. In: Proceedings of the Sixth Annual Symposium on Logic in Computer Science (LICS \u201991), Netherlands, 1991, pp. 300\u2013309 (1991)"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Hanus, M.: Multiparadigm languages. In: Computing Handbook, Third Edition: Computer Science and Software Engineering, vol. 66, pp. 1\u201317. Springer, Cham (2014)","DOI":"10.1201\/b16812-75"},{"key":"7_CR16","unstructured":"Herbrand, J.: Recherches sur la th\u00e9orie de la d\u00e9monstration. Numdam (1930). http:\/\/eudml.org\/doc\/192791"},{"issue":"4","key":"7_CR17","doi-asserted-by":"publisher","first-page":"150","DOI":"10.2307\/2267778","volume":"3","author":"SC Kleene","year":"1938","unstructured":"Kleene, S.C.: On notation for ordinal numbers. J. Symbolic Logic 3(4), 150\u2013155 (1938)","journal-title":"J. Symbolic Logic"},{"key":"7_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)"},{"key":"7_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-96826-6","volume-title":"Foundations of Logic Programming","author":"JW Lloyd","year":"1984","unstructured":"Lloyd, J.W.: Foundations of Logic Programming. Springer-Verlag, Berlin (1984). https:\/\/doi.org\/10.1007\/978-3-642-96826-6"},{"issue":"9","key":"7_CR20","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1145\/609769.609782","volume":"36","author":"L Lu","year":"2001","unstructured":"Lu, L.: On Dart-Zobel algorithm for testing regular type inclusion. Sigplan Not. 36(9), 81\u201385 (2001)","journal-title":"Sigplan Not."},{"issue":"2","key":"7_CR21","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1145\/357162.357169","volume":"4","author":"A Martelli","year":"1982","unstructured":"Martelli, A., Montanari, U.: An efficient unification algorithm. ACM Trans. Program. Lang. Syst. 4(2), 258\u2013282 (1982). https:\/\/doi.org\/10.1145\/357162.357169","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"3","key":"7_CR22","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1016\/0022-0000(78)90014-4","volume":"17","author":"R Milner","year":"1978","unstructured":"Milner, R.: A theory of type polymorphism in programming. J. Comput. Syst. Sci. 17(3), 348\u2013375 (1978)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"7_CR23","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."},{"issue":"1","key":"7_CR24","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/321250.321253","volume":"12","author":"JA Robinson","year":"1965","unstructured":"Robinson, J.A.: A Machine-Oriented Logic Based on the Resolution Principle. J. ACM 12(1), 23\u201341 (1965)","journal-title":"J. ACM"},{"key":"7_CR25","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":"7_CR26","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":"7_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-00590-9_1","volume-title":"Programming Languages and Systems","author":"P Wadler","year":"2009","unstructured":"Wadler, P., Findler, R.B.: Well-typed programs can\u2019t be blamed. In: Castagna, G. (ed.) ESOP 2009. LNCS, vol. 5502, pp. 1\u201316. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00590-9_1"},{"key":"7_CR28","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":"7_CR29","unstructured":"Zobel, J.: Derivation of polymorphic types for Prolog programs. In: Logic Programming, Proceedings of the Fourth International Conference, 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-031-16767-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,14]],"date-time":"2022-09-14T23:17:20Z","timestamp":1663197440000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-16767-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031167669","9783031167676"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-16767-6_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"11 September 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":"Tbilisi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Georgia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lopstr2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/lopstr2022.webs.upv.es","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":"17","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":"47% - 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":"3","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)"}}]}}