{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T21:24:31Z","timestamp":1782422671214,"version":"3.54.5"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030467135","type":"print"},{"value":"9783030467142","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-46714-2_18","type":"book-chapter","created":{"date-parts":[[2020,5,4]],"date-time":"2020-05-04T23:29:02Z","timestamp":1588634942000},"page":"286-307","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["ICurry"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4522-7658","authenticated-orcid":false,"given":"Sergio","family":"Antoy","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4953-8202","authenticated-orcid":false,"given":"Michael","family":"Hanus","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andy","family":"Jost","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Steven","family":"Libby","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,5,5]]},"reference":[{"issue":"1","key":"18_CR1","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1016\/j.jsc.2004.01.001","volume":"40","author":"E Albert","year":"2005","unstructured":"Albert, E., Hanus, M., Huch, F., Oliver, J., Vidal, G.: Operational semantics for declarative multi-paradigm languages. J. Symb. Comput. 40(1), 795\u2013829 (2005)","journal-title":"J. Symb. Comput."},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BFb0013825","volume-title":"Algebraic and Logic Programming","author":"S Antoy","year":"1992","unstructured":"Antoy, S.: Definitional trees. In: Kirchner, H., Levi, G. (eds.) ALP 1992. LNCS, vol. 632, pp. 143\u2013157. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/BFb0013825"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Antoy, S.: Constructor-based conditional narrowing. In: Proceedings of the 3rd International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, PPDP 2001, pp. 199\u2013206. ACM Press (2001)","DOI":"10.1145\/773184.773205"},{"issue":"1","key":"18_CR4","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1016\/j.jsc.2004.12.007","volume":"40","author":"S Antoy","year":"2005","unstructured":"Antoy, S.: Evaluation strategies for functional logic programming. J. Symb. Comput. 40(1), 875\u2013903 (2005)","journal-title":"J. Symb. Comput."},{"issue":"4\u20135","key":"18_CR5","first-page":"713","volume":"11","author":"S Antoy","year":"2011","unstructured":"Antoy, S.: On the correctness of pull-tabbing. TPLP 11(4\u20135), 713\u2013730 (2011)","journal-title":"TPLP"},{"issue":"4","key":"18_CR6","doi-asserted-by":"publisher","first-page":"776","DOI":"10.1145\/347476.347484","volume":"47","author":"S Antoy","year":"2000","unstructured":"Antoy, S., Echahed, R., Hanus, M.: A needed narrowing strategy. J. ACM 47(4), 776\u2013822 (2000)","journal-title":"J. ACM"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/11799573_9","volume-title":"Logic Programming","author":"S Antoy","year":"2006","unstructured":"Antoy, S., Hanus, M.: Overlapping rules and logic variables in functional logic programs. In: Etalle, S., Truszczy\u0144ski, M. (eds.) ICLP 2006. LNCS, vol. 4079, pp. 87\u2013101. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11799573_9"},{"issue":"4","key":"18_CR8","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/1721654.1721675","volume":"53","author":"S Antoy","year":"2010","unstructured":"Antoy, S., Hanus, M.: Functional logic programming. Commun. ACM 53(4), 74\u201385 (2010)","journal-title":"Commun. ACM"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-642-27694-1_4","volume-title":"Practical Aspects of Declarative Languages","author":"S Antoy","year":"2012","unstructured":"Antoy, S., Hanus, M.: Contracts and specifications for functional logic programming. In: Russo, C., Zhou, N.-F. (eds.) PADL 2012. LNCS, vol. 7149, pp. 33\u201347. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-27694-1_4"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Antoy, S., Hanus, M., Libby, S.: Proving non-deterministic computations in Agda. In: Proceedings of the 24th International Workshop on Functional and (Constraint) Logic Programming, WFLP 2016. Volume 234 of Electronic Proceedings in Theoretical Computer Science, pp. 180\u2013195. Open Publishing Association (2017)","DOI":"10.4204\/EPTCS.234.13"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-319-63139-4_6","volume-title":"Logic-Based Program Synthesis and Transformation","author":"S Antoy","year":"2017","unstructured":"Antoy, S., Jost, A.: A new functional-logic compiler for Curry: Sprite. In: Hermenegildo, M.V., Lopez-Garcia, P. (eds.) LOPSTR 2016. LNCS, vol. 10184, pp. 97\u2013113. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63139-4_6"},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-22531-4_1","volume-title":"Functional and Constraint Logic Programming","author":"B Bra\u00dfel","year":"2011","unstructured":"Bra\u00dfel, B., Hanus, M., Peem\u00f6ller, B., Reck, F.: KiCS2: a new compiler from Curry to Haskell. In: Kuchen, H. (ed.) WFLP 2011. LNCS, vol. 6816, pp. 1\u201318. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22531-4_1"},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-540-76637-7_9","volume-title":"Programming Languages and Systems","author":"B Bra\u00dfel","year":"2007","unstructured":"Bra\u00dfel, B., Huch, F.: On a tighter integration of functional and logic programming. In: Shao, Z. (ed.) APLAS 2007. LNCS, vol. 4807, pp. 122\u2013138. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-76637-7_9"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Burn, G.L., Peyton Jones, S.L., Robson, J.D.: The spineless G-machine. In: Proceedings of the 1988 ACM Conference on LISP and Functional Programming, pp. 244\u2013258. ACM (1988)","DOI":"10.1145\/62678.62717"},{"key":"18_CR15","unstructured":"Caballero, R., S\u00e1nchez, J. (eds.): TOY: A Multiparadigm Declarative Language (version 2.3.1) (2007). http:\/\/toy.sourceforge.net"},{"key":"18_CR16","unstructured":"Echahed, R., Janodet, J.-C.: On constructor-based graph rewriting systems. Research report IMAG 985-I, IMAG-LSR, CNRS, Grenoble (1997)"},{"key":"18_CR17","unstructured":"Hanus, M.: FlatCurry: an intermediate representation for Curry programs (2008). http:\/\/www.informatik.uni-kiel.de\/~curry\/flat\/"},{"key":"18_CR18","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"},{"key":"18_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-319-94460-9_19","volume-title":"Logic-Based Program Synthesis and Transformation","author":"M Hanus","year":"2018","unstructured":"Hanus, M.: Combining static and dynamic contract checking for curry. In: Fioravanti, F., Gallagher, J.P. (eds.) LOPSTR 2017. LNCS, vol. 10855, pp. 323\u2013340. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94460-9_19"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Hanus, M.: Verifying fail-free declarative programs. In: Proceedings of the 20th International Symposium on Principles and Practice of Declarative Programming, PPDP 2018, pp. 12:1\u201312:13. ACM Press (2018)","DOI":"10.1145\/3236950.3236957"},{"key":"18_CR21","unstructured":"Hanus, M., et al.: PAKCS: The Portland Aachen Kiel Curry System (2018). http:\/\/www.informatik.uni-kiel.de\/~pakcs\/"},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"Hanus, M., Skrlac, F.: A modular and generic analysis server system for functional logic programs. In: Proceedings of the ACM SIGPLAN 2014 Workshop on Partial Evaluation and Program Manipulation, PEPM 2014, pp. 181\u2013188. ACM Press (2014)","DOI":"10.1145\/2543728.2543744"},{"key":"18_CR23","doi-asserted-by":"crossref","unstructured":"Hanus, M., Teegen, F.: Adding Data to Curry. In: Proceedings of the Conference on Declarative Programming (Declare 2019). LNCS. Springer (2019)","DOI":"10.1007\/978-3-030-46714-2_15"},{"key":"18_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/3-540-15975-4_50","volume-title":"Functional Programming Languages and Computer Architecture","author":"RB Kieburtz","year":"1985","unstructured":"Kieburtz, R.B.: The G-machine: a fast, graph-reduction evaluator. In: Jouannaud, J.-P. (ed.) FPCA 1985. LNCS, vol. 201, pp. 400\u2013413. Springer, Heidelberg (1985). https:\/\/doi.org\/10.1007\/3-540-15975-4_50"},{"key":"18_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/3-540-48685-2_19","volume-title":"Rewriting Techniques and Applications","author":"FJ L\u00f3pez Fraguas","year":"1999","unstructured":"L\u00f3pez Fraguas, F.J., S\u00e1nchez Hern\u00e1ndez, J.: TOY: a multiparadigm declarative system. In: Narendran, P., Rusinowitch, M. (eds.) RTA 1999. LNCS, vol. 1631, pp. 244\u2013247. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48685-2_19"},{"key":"18_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/3-540-53162-9_47","volume-title":"Algebraic and Logic Programming","author":"J Jos\u00e9 Moreno-Navarro","year":"1990","unstructured":"Jos\u00e9 Moreno-Navarro, J., Kuchen, H., Loogen, R.: Lazy narrowing in a graph machine. In: Kirchner, H., Wechler, W. (eds.) ALP 1990. LNCS, vol. 463, pp. 298\u2013317. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/3-540-53162-9_47"},{"key":"18_CR27","volume-title":"Equational Logic as a Programming Language","author":"MJ O\u2019Donnell","year":"1985","unstructured":"O\u2019Donnell, M.J.: Equational Logic as a Programming Language. MIT Press, Cambridge (1985)"},{"key":"18_CR28","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1142\/9789812815149_0001","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation, Volume 2: Applications, Languages and Tools","author":"D Plump","year":"1999","unstructured":"Plump, D.: Term graph rewriting. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) Handbook of Graph Grammars and Computing by Graph Transformation, Volume 2: Applications, Languages and Tools, pp. 3\u201361. World Scientific, Singapore (1999)"},{"key":"18_CR29","unstructured":"Reddy, U.S.: Narrowing as the operational semantics of functional languages. In: Proceedings of the IEEE International Symposium on Logic Programming, Boston, pp. 138\u2013151 (1985)"},{"key":"18_CR30","unstructured":"Wittorf, M.A.: Generic translation of Curry programs into imperative programs. Master\u2019s thesis, Kiel University (2018). (in German)"}],"container-title":["Lecture Notes in Computer Science","Declarative Programming and Knowledge Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-46714-2_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,12]],"date-time":"2021-03-12T21:20:09Z","timestamp":1615584009000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-46714-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030467135","9783030467142"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-46714-2_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"5 May 2020","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":"Cottbus","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wflp2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.declare19.de\/","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":"8","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":"6","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":"75% - 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.5","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":"1.5","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 paper of an invited talk","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)"}}]}}