{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:40:08Z","timestamp":1743144008384,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030162016"},{"type":"electronic","value":"9783030162023"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-16202-3_9","type":"book-chapter","created":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T05:04:08Z","timestamp":1552626248000},"page":"145-161","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["FMS: Functional Programming as a Modelling Language"],"prefix":"10.1007","author":[{"given":"Ingmar","family":"Dasseville","sequence":"first","affiliation":[]},{"given":"Gerda","family":"Janssens","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,3,16]]},"reference":[{"key":"9_CR1","volume-title":"Modern Compiler Implementation in C","author":"AW Appel","year":"1998","unstructured":"Appel, A.W.: Modern Compiler Implementation in C. Cambridge University Press, Cambridge (1998)"},{"key":"9_CR2","unstructured":"Blockeel, H., et al.: Modeling machine learning and data mining problems with FO(\n                      \n                        \n                      \n                      $$\\cdot $$\n                    ). In: Dovier, A., Costa, V.S. (eds.) Proceedings of the 28th International Conference on Logic Programming - Technical Communications (ICLP 2012). LIPIcs, vol. 17, pp. 14\u201325. Schloss Daghstuhl - Leibniz-Zentrum fuer Informatik, September 2012"},{"key":"9_CR3","unstructured":"Calimeri, F., et al.: ASP-Core-2 input language format. Technical report, ASP Standardization Working Group (2013)"},{"key":"9_CR4","unstructured":"Dasseville, I., van der Hallen, M., Bogaerts, B., Janssens, G., Denecker, M.: A compositional typed higher-order logic with definitions. In: Carro, M., King, A., De Vos, M., Saeedloei, N. (eds.) ICLP 2016. OASIcs, vol. 52, pp. 14.1\u201314.14. Schloss Dagstuhl, November 2016"},{"key":"9_CR5","unstructured":"De Cat, B.: Separating knowledge from computation: an FO(\n                      \n                        \n                      \n                      $$\\cdot $$\n                    ) knowledge base system and its model expansion inference. Ph.D. thesis, KU Leuven, Leuven, Belgium, May 2014"},{"key":"9_CR6","unstructured":"Ianni, G., Ielpa, G., Pietramala, A., Santoro, M.C., Calimeri, F.: Enhancing answer set programming with templates. In: Delgrande, J.P., Schaub, T. (eds.) 10th International Workshop on Non-Monotonic Reasoning (NMR 2004), Whistler, Canada, 6\u20138 June 2004, pp. 233\u2013239 (2004)"},{"issue":"4\u20135","key":"9_CR7","first-page":"691","volume":"13","author":"J Jansen","year":"2013","unstructured":"Jansen, J., Jorissen, A., Janssens, G.: Compiling input\n                      \n                        \n                      \n                      $$\\ast $$\n                     FO(\n                      \n                        \n                      \n                      $$\\cdot $$\n                    ) inductive definitions into tabled Prolog rules for IDP3. TPLP 13(4\u20135), 691\u2013704 (2013)","journal-title":"TPLP"},{"issue":"4&5","key":"9_CR8","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1017\/S0956796802004331","volume":"12","author":"SL Peyton Jones","year":"2002","unstructured":"Peyton Jones, S.L., Marlow, S.: Secrets of the Glasgow Haskell Compiler inliner. J. Funct. Program. 12(4&5), 393\u2013433 (2002)","journal-title":"J. Funct. Program."},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1007\/978-3-540-45236-2_46","volume-title":"FME 2003: Formal Methods","author":"M Leuschel","year":"2003","unstructured":"Leuschel, M., Butler, M.: ProB: a model checker for B. In: Araki, K., Gnesi, S., Mandrioli, D. (eds.) FME 2003. LNCS, vol. 2805, pp. 855\u2013874. Springer, Heidelberg (2003). \n                      https:\/\/doi.org\/10.1007\/978-3-540-45236-2_46"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Marlow, S., Peyton Jones, S., Kmett, E., Mokhov, A.: Desugaring Haskell\u2019s do-notation into applicative operations. In: Proceedings of the 9th International Symposium on Haskell, pp. 92\u2013104. ACM (2016)","DOI":"10.1145\/3241625.2976007"},{"key":"9_CR11","unstructured":"Microsoft. Language Server Protocol (2018)"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/978-3-540-74970-7_38","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"N Nethercote","year":"2007","unstructured":"Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., Tack, G.: MiniZinc: towards a standard CP modelling language. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 529\u2013543. Springer, Heidelberg (2007). \n                      https:\/\/doi.org\/10.1007\/978-3-540-74970-7_38"},{"key":"9_CR13","unstructured":"Parr, T.: The definitive ANTLR 4 reference. In: Pragmatic Bookshelf (2013)"},{"key":"9_CR14","volume-title":"Types and Programming Languages","author":"BC Pierce","year":"2002","unstructured":"Pierce, B.C.: Types and Programming Languages. MIT Press, Cambridge (2002)"},{"key":"9_CR15","unstructured":"Provetti, A., Son, T.C. (eds.): Answer Set Programming, Towards Efficient and Scalable Knowledge Representation and Reasoning, Proceedings of the 1st International ASP 2001 Workshop, Stanford, 26\u201328 March 2001"},{"issue":"6","key":"9_CR16","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1017\/S0956796809990086","volume":"19","author":"T Schrijvers","year":"2009","unstructured":"Schrijvers, T., Stuckey, P.J., Wadler, P.: Monadic constraint programming. J. Funct. Program. 19(6), 663\u2013697 (2009)","journal-title":"J. Funct. Program."},{"key":"9_CR17","unstructured":"Peyton-Jones, S., Marlow, S.: The Glasgow Haskell Compiler (2012)"},{"issue":"4","key":"9_CR18","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1017\/S0960129500001560","volume":"2","author":"P Wadler","year":"1992","unstructured":"Wadler, P.: Comprehending monads. Math. Struct. Comput. Sci. 2(4), 461\u2013493 (1992)","journal-title":"Math. Struct. Comput. Sci."},{"key":"9_CR19","unstructured":"Wazny, J.R.: Type inference and type error diagnosis for Hindley\/Milner with extensions. Citeseer (2006)"},{"key":"9_CR20","unstructured":"Wittocx, J., Mari\u00ebn, M., Denecker, M.: Grounding with bounds. In: Fox, D., Gomes, C.P. (eds.) AAAI, pp. 572\u2013577. AAAI Press (2008)"},{"key":"9_CR21","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1613\/jair.2980","volume":"38","author":"J Wittocx","year":"2010","unstructured":"Wittocx, J., Mari\u00ebn, M., Denecker, M.: Grounding FO and FO(ID) with bounds. J. Artif. Intell. Res. (JAIR) 38, 223\u2013269 (2010)","journal-title":"J. Artif. Intell. Res. (JAIR)"}],"container-title":["Lecture Notes in Computer Science","Functional and Constraint Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-16202-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T08:54:30Z","timestamp":1558342470000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-16202-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030162016","9783030162023"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-16202-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"16 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WFLP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Functional and Constraint Logic Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Frankfurt\/Main","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wflp2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ppdp-lopstr-18.cs.uni-frankfurt.de\/wflp18.html","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"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"19","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"10","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"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"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"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"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}