{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,13]],"date-time":"2025-09-13T16:10:39Z","timestamp":1757779839240},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319516752"},{"type":"electronic","value":"9783319516769"}],"license":[{"start":{"date-parts":[[2016,12,17]],"date-time":"2016-12-17T00:00:00Z","timestamp":1481932800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-51676-9_1","type":"book-chapter","created":{"date-parts":[[2016,12,17]],"date-time":"2016-12-17T07:14:29Z","timestamp":1481958869000},"page":"1-18","source":"Crossref","is-referenced-by-count":3,"title":["Eliminating Irrelevant Non-determinism in Functional Logic Programs"],"prefix":"10.1007","author":[{"given":"Sergio","family":"Antoy","sequence":"first","affiliation":[]},{"given":"Michael","family":"Hanus","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,12,17]]},"reference":[{"issue":"1","key":"1_CR1","doi-asserted-by":"crossref","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. Symbolic Comput. 40(1), 795\u2013829 (2005)","journal-title":"J. Symbolic Comput."},{"key":"1_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). doi: 10.1007\/BFb0013825"},{"issue":"4","key":"1_CR3","doi-asserted-by":"crossref","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":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/11680093_2","volume-title":"Logic Based Program Synthesis and Transformation","author":"S Antoy","year":"2006","unstructured":"Antoy, S., Hanus, M.: Declarative programming with function patterns. In: Hill, P.M. (ed.) LOPSTR 2005. LNCS, vol. 3901, pp. 6\u201322. Springer, Heidelberg (2006). doi: 10.1007\/11680093_2"},{"key":"1_CR5","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). doi: 10.1007\/11799573_9"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Antoy, S., Hanus, M.: Set functions for functional logic programming. In: Proceedings of PPDP 2009, pp. 73\u201382. ACM Press (2009)","DOI":"10.1145\/1599410.1599420"},{"issue":"4","key":"1_CR7","doi-asserted-by":"crossref","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":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-319-28228-2_5","volume-title":"Practical Aspects of Declarative Languages","author":"S Antoy","year":"2016","unstructured":"Antoy, S., Hanus, M.: Default rules for Curry. In: Gavanelli, M., Reppy, J. (eds.) PADL 2016. LNCS, vol. 9585, pp. 65\u201382. Springer, Cham (2016). doi: 10.1007\/978-3-319-28228-2_5"},{"key":"1_CR9","unstructured":"Antoy, S., Hanus, M., Libby, S.: Proving non-deterministic computations in Agda. In: Proceedings of 24th International Workshop on Functional and Logic Programming (WFLP 2016), EPTCS (2016)"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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, B., 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)"},{"key":"1_CR11","unstructured":"Caballero, R., L\u00f3pez-Fraguas, F.J.: Improving deterministic computations in lazy functional logic languages. J. Funct. Logic Program. 2003 (2003)"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/978-3-540-78969-7_23","volume-title":"Functional and Logic Programming","author":"J Christiansen","year":"2008","unstructured":"Christiansen, J., Fischer, S.: EasyCheck \u2014 test data for free. In: Garrigue, J., Hermenegildo, M.V. (eds.) FLOPS 2008. LNCS, vol. 4989, pp. 322\u2013336. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-78969-7_23"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Claessen, K., Hughes, J.: QuickCheck: a lightweight tool for random testing of Haskell programs. In: Proceedings of ICFP 2000, pp. 268\u2013279. ACM Press (2000)","DOI":"10.1145\/351240.351266"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Cleva, J.M., Leach, J., L\u00f3pez-Fraguas, F.J.: A logic programming approach to the verification of functional-logic programs. In: Proceedings of PPDP 2004, pp. 9\u201319. ACM Press (2004)","DOI":"10.1145\/1013963.1013969"},{"key":"1_CR15","unstructured":"Fribourg, L.: Slog: a logic programming language interpreter based on clausal superposition and rewriting. In: Proceedings of IEEE International Symposium on Logic Programming, pp. 172\u2013184 (1985)"},{"key":"1_CR16","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/S0743-1066(98)10029-8","volume":"40","author":"JC Gonz\u00e1lez-Moreno","year":"1999","unstructured":"Gonz\u00e1lez-Moreno, J.C., Hortal\u00e1-Gonz\u00e1lez, M.T., L\u00f3pez-Fraguas, F.J., Rodr\u00edguez-Artalejo, M.: An approach to declarative programming based on a rewriting logic. J. Logic Program. 40, 47\u201387 (1999)","journal-title":"J. Logic Program."},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/BFb0013543","volume-title":"Processing Declarative Knowledge","author":"M Hanus","year":"1991","unstructured":"Hanus, M.: Efficient implementation of narrowing and rewriting. In: Boley, H., Richter, M.M. (eds.) PDK 1991. LNCS, vol. 567, pp. 344\u2013365. Springer, Heidelberg (1991). doi: 10.1007\/BFb0013543"},{"key":"1_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). doi: 10.1007\/978-3-642-37651-1_6"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Hanus, M., Skrlac, F.: A modular and generic analysis server system for functional logic programs. In: Proceedings of PEPM 2014, pp. 181\u2013188. ACM Press (2014)","DOI":"10.1145\/2543728.2543744"},{"key":"1_CR20","unstructured":"Hanus, M. et al.: PAKCS: The Portland Aachen Kiel Curry System (2016). http:\/\/www.informatik.uni-kiel.de\/~pakcs\/"},{"key":"1_CR21","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0304-3975(94)00225-8","volume":"142","author":"R Loogen","year":"1995","unstructured":"Loogen, R., Winkler, S.: Dynamic detection of determinism in functional logic languages. Theor. Comput. Sci. 142, 59\u201387 (1995)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"L\u00f3pez-Fraguas, F.J., Rodr\u00edguez-Hortal\u00e1, J., S\u00e1nchez-Hern\u00e1ndez, J.: A simple rewrite notion for call-time choice semantics. In: Proceedings of PPDP 2007, pp. 197\u2013208. ACM Press (2007)","DOI":"10.1145\/1273920.1273947"},{"key":"1_CR23","doi-asserted-by":"crossref","DOI":"10.1145\/2841316","volume-title":"Verified Functional Programming in Agda","author":"A Stump","year":"2016","unstructured":"Stump, A.: Verified Functional Programming in Agda. ACM and Morgan & Claypool, New York (2016)"},{"key":"1_CR24","unstructured":"TeReSe: Term Rewriting Systems, vol. 55 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge (2003)"}],"container-title":["Lecture Notes in Computer Science","Practical Aspects of Declarative Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-51676-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T06:05:34Z","timestamp":1498370734000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-51676-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,17]]},"ISBN":["9783319516752","9783319516769"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-51676-9_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016,12,17]]}}}