{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T22:10:08Z","timestamp":1745964608941,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642370359"},{"type":"electronic","value":"9783642370366"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37036-6_2","type":"book-chapter","created":{"date-parts":[[2013,2,18]],"date-time":"2013-02-18T19:35:55Z","timestamp":1361216155000},"page":"21-40","source":"Crossref","is-referenced-by-count":2,"title":["The Compiler Forest"],"prefix":"10.1007","author":[{"given":"Mihai","family":"Budiu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joel","family":"Galenson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gordon D.","family":"Plotkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/3-540-45699-6_2","volume-title":"Applied Semantics","author":"N. Benton","year":"2002","unstructured":"Benton, N., Hughes, J., Moggi, E.: Monads and Effects. In: Barthe, G., Dybjer, P., Pinto, L., Saraiva, J. (eds.) APPSEM 2000. LNCS, vol.\u00a02395, pp. 42\u2013122. Springer, Heidelberg (2002)"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Blass, A.: Questions and answers \u2013 a category arising in linear logic, complexity theory, and set theory. In: Advances in Linear Logic. London Math. Soc. Lecture Notes, vol.\u00a0222, pp. 61\u201381 (1995)","DOI":"10.1017\/CBO9780511629150.004"},{"issue":"1","key":"2_CR3","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1145\/181550.181564","volume":"23","author":"P. Buneman","year":"1994","unstructured":"Buneman, P., et al.: Comprehension syntax. SIGMOD Record\u00a023(1), 87\u201396 (1994)","journal-title":"SIGMOD Record"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Chang, B.-Y.E., Harren, M., Necula, G.C.: Analysis of low-level code using cooperating decompilers. In: Proc. 13th SAS, pp. 318\u2013335. ACM (2006)","DOI":"10.1007\/11823230_21"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"de Paiva, V.: The Dialectica categories. In: Proc. Cat. in Comp. Sci. and Logic, 1987. Cont. Math., vol.\u00a092, pp. 47\u201362. AMS (1989)","DOI":"10.1090\/conm\/092\/1003194"},{"key":"2_CR6","unstructured":"Dean, J., Ghemawat, S.: MapReduce: Simplified data processing on large clusters. In: Proc. 6th OSDI, pp. 137\u2013150. ACM (2004)"},{"key":"2_CR7","unstructured":"Duffy, J.: Concurrent Programming on Windows. Addison Wesley (2008)"},{"issue":"5","key":"2_CR8","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1017\/S0956796801004075","volume":"11","author":"M. Erwig","year":"2001","unstructured":"Erwig, M.: Inductive graphs and functional graph algorithms. J. Funct. Program.\u00a011(5), 467\u2013492 (2001)","journal-title":"J. Funct. Program."},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Ghemawat, S., Gobioff, H., Leung, L.: The Google file system. In: Proc. 19th SOSP, pp. 29\u201343. ACM (2003)","DOI":"10.1145\/1165389.945450"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-09724-4","volume-title":"Edinburgh LCF","author":"M.J. Gordon","year":"1979","unstructured":"Gordon, M.J., Milner, A.J., Wadsworth, C.P.: Edinburgh LCF. LNCS, vol.\u00a078. Springer, Heidelberg (1979)"},{"issue":"4","key":"2_CR11","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1017\/S0956796899003500","volume":"9","author":"G. Hutton","year":"1999","unstructured":"Hutton, G.: A tutorial on the universality and expressiveness of fold. J. Funct. Program.\u00a09(4), 355\u2013372 (1999)","journal-title":"J. Funct. Program."},{"issue":"1-3","key":"2_CR12","first-page":"43","volume":"114","author":"J.M.E. Hyland","year":"2002","unstructured":"Hyland, J.M.E.: Proof theory in the abstract. APAL\u00a0114(1-3), 43\u201378 (2002)","journal-title":"APAL"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Kelsey, R., Hudak, P.: Realistic compilation by program transformation. In: Proc. 16th POPL, pp. 281\u2013292. ACM (1989)","DOI":"10.1145\/75277.75302"},{"issue":"4","key":"2_CR14","first-page":"97","volume":"26","author":"A. Kock","year":"2012","unstructured":"Kock, A.: Commutative monads as a theory of distributions. Theory and Applications of Categories\u00a026(4), 97\u2013131 (2012)","journal-title":"Theory and Applications of Categories"},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/371578.371598","volume":"32","author":"D. Kossmann","year":"2000","unstructured":"Kossmann, D.: The state of the art in distributed query processing. ACM Comput. Surv.\u00a032, 422\u2013469 (2000)","journal-title":"ACM Comput. Surv."},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Lerner, S., et al.: Composing dataflow analyses and transformations. In: Proc. 29th POPL, pp. 270\u2013282. ACM (2002)","DOI":"10.1145\/565816.503298"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Meijer, E., et al.: LINQ: reconciling object, relations and XML in the .NET framework. In: Proc. SIGMOD Int. Conf. on Manage. Data, p. 706. ACM (2006)","DOI":"10.1145\/1142473.1142552"},{"key":"2_CR18","doi-asserted-by":"crossref","first-page":"330","DOI":"10.14778\/1920841.1920886","volume":"3","author":"S. Melnik","year":"2010","unstructured":"Melnik, S., et al.: Dremel: interactive analysis of web-scale datasets. Proc. VLDB Endow.\u00a03, 330\u2013339 (2010)","journal-title":"Proc. VLDB Endow."},{"issue":"1522","key":"2_CR19","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1098\/rsta.1984.0067","volume":"312","author":"R. Milner","year":"1984","unstructured":"Milner, R., Bird, R.: The use of machines to assist in rigorous proof. Phil. Trans. R. Soc. Lond. A\u00a0312(1522), 411\u2013422 (1984)","journal-title":"Phil. Trans. R. Soc. Lond. A"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Moggi, E.: Computational lambda-calculus and monads. In: Proc. 4th LICS, pp. 14\u201323. IEEE Computer Society (1989)","DOI":"10.1109\/LICS.1989.39155"},{"issue":"1","key":"2_CR21","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":"2_CR22","unstructured":"Pierce, B.C.: Types and programming languages. MIT Press (2002)"},{"issue":"5","key":"2_CR23","first-page":"453","volume":"7","author":"J. Power","year":"1997","unstructured":"Power, J., Robinson, E.: Premonoidal categories and notions of computation. MSCS\u00a07(5), 453\u2013468 (1997)","journal-title":"MSCS"},{"issue":"5","key":"2_CR24","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1017\/S0956796805005605","volume":"15","author":"D. Sarkar","year":"2005","unstructured":"Sarkar, D., Waddell, O., Dybvig, R.K.: Educational pearl: A nanopass framework for compiler education. J. Funct. Program.\u00a015(5), 653\u2013667 (2005)","journal-title":"J. Funct. Program."},{"key":"2_CR25","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1145\/96602.96604","volume":"22","author":"A. Sheth","year":"1990","unstructured":"Sheth, A., Larson, J.: Federated database systems for managing distributed, heterogeneous, and autonomous databases. ACM Comput. Surv.\u00a022, 183\u2013236 (1990)","journal-title":"ACM Comput. Surv."},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Tarditi, D., Puri, S., Oglesby, J.: Accelerator: using data parallelism to program GPU\u2019s for general-purpose uses. In: Proc. 12th. ASPLOS, pp. 325\u2013335. ACM (2006)","DOI":"10.1145\/1168857.1168898"},{"key":"2_CR27","unstructured":"Yu, Y., et al.: DryadLINQ: A system for general-purpose distributed data-parallel computing using a high-level language. In: Proc. 8th OSDI, pp. 1\u201314. ACM (2008)"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37036-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T21:32:36Z","timestamp":1745962356000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37036-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642370359","9783642370366"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37036-6_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}