{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T01:50:57Z","timestamp":1725846657094},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319282275"},{"type":"electronic","value":"9783319282282"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-28228-2_5","type":"book-chapter","created":{"date-parts":[[2016,1,8]],"date-time":"2016-01-08T06:54:42Z","timestamp":1452236082000},"page":"65-82","source":"Crossref","is-referenced-by-count":1,"title":["Default Rules for Curry"],"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,1,9]]},"reference":[{"key":"5_CR1","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)"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/BFb0027000","volume-title":"Algebraic and Logic Programming","author":"S Antoy","year":"1997","unstructured":"Antoy, S.: Optimal non-deterministic functional logic computations. In: Hanus, M., Heering, J., Meinke, K. (eds.) ALP\/HOA 1997. LNCS, vol. 1298, pp. 16\u201330. Springer, Heidelberg (1997)"},{"issue":"4","key":"5_CR3","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":"5_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)"},{"key":"5_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-asserted-by":"crossref","unstructured":"Antoy, S., Hanus, M.: Set functions for functional logic programming. In: Proceedings of the 11th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming (PPDP 2009), pp. 73\u201382. ACM Press (2009)","key":"5_CR6","DOI":"10.1145\/1599410.1599420"},{"issue":"4","key":"5_CR7","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"},{"unstructured":"Antoy, S., Hanus, M.: Curry without success. In: Proceedings of the 23rd International Workshop on Functional and (Constraint) Logic Programming (WFLP 2014). CEUR Workshop Proceedings, vol. 1335, pp. 140\u2013154. CEUR-WS.org (2014)","key":"5_CR8"},{"doi-asserted-by":"crossref","unstructured":"Bra\u00dfel, B., Hanus, M., Huch, F.: Encapsulating non-determinism in functional logic computations. J. Funct. Logic Program. 2004(6) (2004)","key":"5_CR9","DOI":"10.1007\/978-3-540-24836-1_14"},{"key":"5_CR10","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)"},{"doi-asserted-by":"crossref","unstructured":"Christiansen, J., Hanus, M., Reck, F., Seidel, D.: A semantics for weakly encapsulated search in functional logic programs. In: Proceedings of the 15th International Symposium on Principle and Practice of Declarative Programming (PPDP 2013), pp. 49\u201360. ACM Press (2013)","key":"5_CR11","DOI":"10.1145\/2505879.2505896"},{"key":"5_CR12","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)"},{"key":"5_CR13","doi-asserted-by":"publisher","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."},{"unstructured":"Hanus, M.: Declarative processing of semistructured web data. In: Technical Communications of the 27th International Conference on Logic Programming. Leibniz International Proceedings in Informatics (LIPIcs), vol. 11, pp. 198\u2013208 (2011)","key":"5_CR14"},{"key":"5_CR15","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)"},{"unstructured":"Hanus, M., Antoy, S., Bra\u00dfel, B., Engelke, M., H\u00f6ppner, K., Koj, J., Niederau, P., Sadre, R., Steiner, F.: PAKCS: The Portland Aachen Kiel Curry System (2015). \n                      http:\/\/www.informatik.uni-kiel.de\/~pakcs\/","key":"5_CR16"},{"unstructured":"Hanus, M. (ed.): Curry: An integrated functional logic language (vers. 0.8.3) (2012). \n                      http:\/\/www.curry-language.org","key":"5_CR17"},{"doi-asserted-by":"crossref","unstructured":"Krauss, A.: Pattern minimization problems over recursive data types. In: Proceedings of the 13th ACM SIGPLAN International Conference on Functional Programming (ICFP 2008), pp. 267\u2013274. ACM Press (2008)","key":"5_CR18","DOI":"10.1145\/1411204.1411242"},{"issue":"1","key":"5_CR19","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1017\/S1471068403001728","volume":"4","author":"FJ L\u00f3pez-Fraguas","year":"2004","unstructured":"L\u00f3pez-Fraguas, F.J., S\u00e1nchez-Hern\u00e1ndez, J.: A proof theoretic approach to failure in functional logic programming. Theory Pract. Logic Program. 4(1), 41\u201374 (2004)","journal-title":"Theory Pract. Logic Program."},{"unstructured":"Moreno-Navarro, J.J.: Default rules: an extension of constructive negation for narrowing-based languages. In: Proceedings of Eleventh International Conference on Logic Programming, pp. 535\u2013549. MIT Press (1994)","key":"5_CR20"},{"volume-title":"Haskell 98 Language and Libraries\u2014The Revised Report","year":"2003","unstructured":"Peyton Jones, S. (ed.): Haskell 98 Language and Libraries\u2014The Revised Report. Cambridge University Press, Cambridge (2003)","key":"5_CR21"},{"unstructured":"Reddy, U.S.: Narrowing as the operational semantics of functional languages. In: Proceedings of IEEE International Symposium on Logic Programming, Boston, pp. 138\u2013151 (1985)","key":"5_CR22"},{"issue":"11","key":"5_CR23","first-page":"1574","volume":"12","author":"J S\u00e1nchez-Hern\u00e1ndez","year":"2006","unstructured":"S\u00e1nchez-Hern\u00e1ndez, J.: Constructive failure in functional-logic programming: from theory to implementation. J. Univ. Comput. Sci. 12(11), 1574\u20131593 (2006)","journal-title":"J. Univ. Comput. Sci."},{"issue":"4","key":"5_CR24","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1145\/321850.321859","volume":"21","author":"JR Slagle","year":"1974","unstructured":"Slagle, J.R.: Automated theorem-proving for theories with simplifiers, commutativity, and associativity. J. ACM 21(4), 622\u2013642 (1974)","journal-title":"J. ACM"}],"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-28228-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T05:05:32Z","timestamp":1559365532000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-28228-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319282275","9783319282282"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-28228-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}