{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:18:48Z","timestamp":1725743928833},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642404467"},{"type":"electronic","value":"9783642404474"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40447-4_13","type":"book-chapter","created":{"date-parts":[[2013,8,6]],"date-time":"2013-08-06T01:00:39Z","timestamp":1375750839000},"page":"198-214","source":"Crossref","is-referenced-by-count":2,"title":["Lingua Franca of Functional Programming (FP)"],"prefix":"10.1007","author":[{"given":"Peter","family":"Kourzanov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Henk","family":"Sips","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"9","key":"13_CR1","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1145\/290229.290234","volume":"33","author":"N.I. Adams IV","year":"1998","unstructured":"Adams IV, N.I., Bartley, D.H., Brooks, G., Dybvig, R.K., Friedman, D.P., Halstead, R., Hanson, C., Haynes, C.T., Kohlbecker, E., Oxley, D., Pitman, K.M., Rozas, G.J., Steele Jr., G.L., Sussman, G.J., Wand, M., Abelson, H.: Revised5 report on the algorithmic language scheme. SIGPLAN Not.\u00a033(9), 26\u201376 (1998)","journal-title":"SIGPLAN Not."},{"issue":"3","key":"13_CR2","first-page":"37","volume":"17","author":"A. Alexandrescu","year":"1999","unstructured":"Alexandrescu, A.: Better template error messages. C\/C++ Users J.\u00a017(3), 37\u201347 (1999)","journal-title":"C\/C++ Users J."},{"unstructured":"Bender, J.: sxml-match.ss. Internet","key":"13_CR3"},{"unstructured":"Calypto. Catapult c. Internet","key":"13_CR4"},{"issue":"5","key":"13_CR5","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/j.scico.2008.09.008","volume":"76","author":"J. Carette","year":"2011","unstructured":"Carette, J., Kiselyov, O.: Multi-stage programming with functors and monads: Eliminating abstraction overhead from generic code. Sci. Comput. Program.\u00a076(5), 349\u2013375 (2011)","journal-title":"Sci. Comput. Program."},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.scico.2005.10.013","volume":"62","author":"A. Cohen","year":"2006","unstructured":"Cohen, A., Donadio, S., Garzaran, M.-J., Herrmann, C., Kiselyov, O., Padua, D.: In search of a program generator to implement generic transformations for high-performance computing. Sci. Comput. Program.\u00a062, 25\u201346 (2006)","journal-title":"Sci. Comput. Program."},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/3-540-63237-9_17","volume-title":"Implementation of Functional Languages","author":"M. Erwig","year":"1997","unstructured":"Erwig, M.: Active patterns. In: Kluge, W.E. (ed.) IFL 1996. LNCS, vol.\u00a01268, pp. 21\u201340. Springer, Heidelberg (1997)"},{"doi-asserted-by":"crossref","unstructured":"Filinski, A.: Representing monads. In: POPL, pp. 446\u2013457 (1994)","key":"13_CR8","DOI":"10.1145\/174675.178047"},{"unstructured":"Foltzer, A.C., Friedman, D.P.: A schemers view of monads. Partial draft (2011)","key":"13_CR9"},{"unstructured":"Forte, D.S.: Cynthesizer. Internet","key":"13_CR10"},{"unstructured":"Friedman, D., Hilsdale, E., Ganz, S., Dybvig, K.: match.ss. Internet","key":"13_CR11"},{"issue":"2","key":"13_CR12","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1145\/1317250.1317252","volume":"2","author":"R.P. Gabriel","year":"1988","unstructured":"Gabriel, R.P.: The why of y. SIGPLAN Lisp Pointers\u00a02(2), 15\u201325 (1988)","journal-title":"SIGPLAN Lisp Pointers"},{"unstructured":"Kiselyov, O.: Monadic programming in scheme. Internet (2005)","key":"13_CR13"},{"key":"13_CR14","first-page":"249","volume-title":"Proceedings of the 4th ACM International Conference on Embedded Software, EMSOFT 2004","author":"O. Kiselyov","year":"2004","unstructured":"Kiselyov, O., Swadi, K.N., Taha, W.: A methodology for generating verified combinatorial circuits. In: Proceedings of the 4th ACM International Conference on Embedded Software, EMSOFT 2004, pp. 249\u2013258. ACM, New York (2004)"},{"issue":"3","key":"13_CR15","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1017\/S0956796805005733","volume":"16","author":"S. Krishnamurthi","year":"2006","unstructured":"Krishnamurthi, S.: Educational pearl: Automata via macros. J. Funct. Program.\u00a016(3), 253\u2013267 (2006)","journal-title":"J. Funct. Program."},{"issue":"5","key":"13_CR16","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.entcs.2011.02.018","volume":"229","author":"S. Lindley","year":"2011","unstructured":"Lindley, S., Wadler, P., Yallop, J.: Idioms are oblivious, arrows are meticulous, monads are promiscuous. Electr. Notes Theor. Comput. Sci.\u00a0229(5), 97\u2013117 (2011)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Meijer, E., Hutton, G.: Bananas in space: Extending fold and unfold to exponential types. In: FPCA, pp. 324\u2013333 (1995)","key":"13_CR17","DOI":"10.1145\/224164.224225"},{"issue":"1","key":"13_CR18","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0890-5401(91)90052-4","volume":"93","author":"E. Moggi","year":"1991","unstructured":"Moggi, E.: Notions of computation and monads. Inf. Comput.\u00a093(1), 55\u201392 (1991)","journal-title":"Inf. Comput."},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/BFb0024194","volume-title":"Programming Language Implementation and Logic Programming","author":"C. Queinnec","year":"1990","unstructured":"Queinnec, C.: Compilation of non-linear, second order patterns on s-expressions. In: Deransart, P., Ma\u0142uszy\u0144ski, J. (eds.) PLILP 1990. LNCS, vol.\u00a0456, pp. 340\u2013357. Springer, Heidelberg (1990)"},{"doi-asserted-by":"crossref","unstructured":"Queinnec, C., Geffroy, P.: Partial evaluation applied to symbolic pattern matching with intelligent backtrack. In: WSA, pp. 109\u2013117 (1992)","key":"13_CR20","DOI":"10.1007\/978-1-4615-3422-8_10"},{"doi-asserted-by":"crossref","unstructured":"Rompf, T., Odersky, M.: Lightweight modular staging: a pragmatic approach to runtime code generation and compiled dsls. In: Visser, E., J\u00e4rvi, J. (eds.) GPCE, pp. 127\u2013136. ACM (2010)","key":"13_CR21","DOI":"10.1145\/1868294.1868314"},{"key":"13_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/3-540-60360-3_50","volume-title":"Static Analysis","author":"M. Serrano","year":"1995","unstructured":"Serrano, M., Weis, P.: Bigloo: A portable and optimizing compiler for strict functional languages. In: Mycroft, A. (ed.) SAS 1995. LNCS, vol.\u00a0983, pp. 366\u2013381. Springer, Heidelberg (1995)"},{"unstructured":"Shinn, A.: match.scm. Internet","key":"13_CR23"},{"unstructured":"Siskind, J.M.: Flow-directed lightweight closure conversion. Technical Report 99-190R, NEC Research Institute, Inc. (1999)","key":"13_CR24"},{"unstructured":"Stroustrup, B.: The c++0x \u201cremove concepts\u201d decision. Internet","key":"13_CR25"},{"key":"13_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-642-28830-2_6","volume-title":"Software Language Engineering","author":"A. Sutton","year":"2012","unstructured":"Sutton, A., Stroustrup, B.: Design of concept libraries for c++. In: Sloane, A., A\u00dfmann, U. (eds.) SLE 2011. LNCS, vol.\u00a06940, pp. 97\u2013118. Springer, Heidelberg (2012)"},{"doi-asserted-by":"crossref","unstructured":"Swadi, K.N., Taha, W., Kiselyov, O., Pasalic, E.: A monadic approach for avoiding code duplication when staging memoized functions. In: Hatcliff, J., Tip, F. (eds.) PEPM, pp. 160\u2013169. ACM (2006)","key":"13_CR27","DOI":"10.1145\/1111542.1111570"},{"unstructured":"Tobin-Hochstadt, S.: Extensible pattern matching in an extensible language. CoRR, abs\/1106.2578 (2011)","key":"13_CR28"},{"doi-asserted-by":"crossref","unstructured":"Tobin-Hochstadt, S., St-Amour, V., Culpepper, R., Flatt, M., Felleisen, M.: Languages as libraries. In: Hall, M.W., Padua, D.A. (eds.) PLDI, pp. 132\u2013141. ACM (2011)","key":"13_CR29","DOI":"10.1145\/1993316.1993514"},{"issue":"4","key":"13_CR30","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1017\/S0960129500001560","volume":"2","author":"P. Wadler","year":"1992","unstructured":"Wadler, P.: Comprehending monads. Mathematical Structures in Computer Science\u00a02(4), 461\u2013493 (1992)","journal-title":"Mathematical Structures in Computer Science"},{"unstructured":"Wright, A.K., Duba, B.F.: Pattern matching for scheme. Technical Report TX 77251-1892, Rice University (May 1995)","key":"13_CR31"},{"unstructured":"Yallop, J.: Ocaml patterns extesions. Internet","key":"13_CR32"}],"container-title":["Lecture Notes in Computer Science","Trends in Functional Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40447-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T12:29:00Z","timestamp":1558009740000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40447-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642404467","9783642404474"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40447-4_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}