{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T03:27:44Z","timestamp":1767929264394,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642207747","type":"print"},{"value":"9783642207754","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-20775-4_7","type":"book-chapter","created":{"date-parts":[[2011,5,21]],"date-time":"2011-05-21T01:38:36Z","timestamp":1305941916000},"page":"119-136","source":"Crossref","is-referenced-by-count":2,"title":["An Adequate, Denotational, Functional-Style Semantics for Typed FlatCurry"],"prefix":"10.1007","author":[{"given":"Jan","family":"Christiansen","sequence":"first","affiliation":[]},{"given":"Daniel","family":"Seidel","sequence":"additional","affiliation":[]},{"given":"Janis","family":"Voigtl\u00e4nder","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","first-page":"1","volume-title":"Handbook of Logic in Computer Science","author":"S. Abramsky","year":"1994","unstructured":"Abramsky, S., Jung, A.: Domain theory. In: Handbook of Logic in Computer Science, pp. 1\u2013168. Oxford University Press, Oxford (1994)"},{"issue":"1","key":"7_CR2","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. Journal of Symbolic Computation\u00a040(1), 795\u2013829 (2005)","journal-title":"Journal of Symbolic Computation"},{"key":"7_CR3","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.\u00a04807, pp. 122\u2013138. Springer, Heidelberg (2007)"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","first-page":"31","volume-title":"WFLP 2010","author":"B. Bra\u00dfel","year":"2011","unstructured":"Bra\u00dfel, B., Fischer, S., Hanus, M., Reck, F.: Transforming functional logic programs into monadic functional programs. In: Mari\u00f1o, J. (ed.) WFLP 2010. LNCS, vol.\u00a06559, pp. 31\u201348. Springer, Heidelberg (2011)"},{"key":"7_CR5","first-page":"39","volume-title":"PLPV 2010","author":"J. Christiansen","year":"2010","unstructured":"Christiansen, J., Seidel, D., Voigtl\u00e4nder, J.: Free theorems for functional logic programs. In: Filli\u00e2tre, J.-C., Flanagan, C. (eds.) PLPV 2010, pp. 39\u201348. ACM Press, New York (2010)"},{"key":"7_CR6","unstructured":"Erk\u00f6k, L.: Value Recursion in Monadic Computations. PhD thesis, OGI School of Science and Engineering, OHSU (2002)"},{"issue":"1","key":"7_CR7","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0743-1066(98)10029-8","volume":"40","author":"J.C. 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. Journal of Logic Programming\u00a040(1), 47\u201387 (1999)","journal-title":"Journal of Logic Programming"},{"key":"7_CR8","series-title":"ENTCS","first-page":"117","volume-title":"PROLE 2006","author":"F.J. L\u00f3pez-Fraguas","year":"2007","unstructured":"L\u00f3pez-Fraguas, F.J., Rodr\u00edguez-Hortal\u00e1, J., S\u00e1nchez-Hern\u00e1ndez, J.: Equivalence of two formal semantics for functional logic programs. In: Lucio, P., Orejas, F. (eds.) PROLE 2006. ENTCS, vol.\u00a0188, pp. 117\u2013142. Elsevier, Amsterdam (2007)"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/978-3-642-02348-4_23","volume-title":"Rewriting Techniques and Applications","author":"F.J. L\u00f3pez-Fraguas","year":"2009","unstructured":"L\u00f3pez-Fraguas, F.J., Rodr\u00edguez-Hortal\u00e1, J., S\u00e1nchez-Hern\u00e1ndez, J.: A fully abstract semantics for constructor systems. In: Treinen, R. (ed.) RTA 2009. LNCS, vol.\u00a05595, pp. 320\u2013334. Springer, Heidelberg (2009)"},{"issue":"2","key":"7_CR10","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1017\/S1471068402001527","volume":"3","author":"J.M. Molina-Bravo","year":"2003","unstructured":"Molina-Bravo, J.M., Pimentel, E.: Composing programs in a rewriting logic for declarative programming. Journal of Theory and Practice of Logic Programming\u00a03(2), 189\u2013221 (2003)","journal-title":"Journal of Theory and Practice of Logic Programming"},{"issue":"5","key":"7_CR11","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1093\/comjnl\/35.5.514","volume":"35","author":"H. S\u00f8ndergaard","year":"1992","unstructured":"S\u00f8ndergaard, H., Sestoft, P.: Non-determinism in functional languages. The Computer Journal\u00a035(5), 514\u2013523 (1992)","journal-title":"The Computer Journal"},{"key":"7_CR12","first-page":"347","volume-title":"FPCA 1989","author":"P. Wadler","year":"1989","unstructured":"Wadler, P.: Theorems for free! In: FPCA 1989, pp. 347\u2013359. ACM Press, New York (1989)"},{"issue":"1","key":"7_CR13","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1145\/248621.248623","volume":"29","author":"M. Walicki","year":"1997","unstructured":"Walicki, M., Meldal, S.: Algebraic approaches to nondeterminism: An overview. ACM Computing Surveys\u00a029(1), 30\u201381 (1997)","journal-title":"ACM Computing Surveys"}],"container-title":["Lecture Notes in Computer Science","Functional and Constraint Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20775-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T05:27:19Z","timestamp":1558589239000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20775-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642207747","9783642207754"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20775-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}