{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T22:23:28Z","timestamp":1745447008453},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319071503"},{"type":"electronic","value":"9783319071510"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07151-0_8","type":"book-chapter","created":{"date-parts":[[2014,5,21]],"date-time":"2014-05-21T23:30:14Z","timestamp":1400715014000},"page":"119-135","source":"Crossref","is-referenced-by-count":6,"title":["Lightweight Higher-Kinded Polymorphism"],"prefix":"10.1007","author":[{"given":"Jeremy","family":"Yallop","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leo","family":"White","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Baars, A.I., Swierstra, S.D.: Typing dynamic typing. In: ICFP 2002, pp. 157\u2013166. ACM, New York (2002), ISBN 1-58113-487-8","DOI":"10.1145\/583852.581494"},{"key":"8_CR2","unstructured":"Chambart, P., Henry, G.: Experiments in generic programming: runtime type representation and implicit values. In: OCaml Users and Developers Workshop (2012)"},{"key":"8_CR3","unstructured":"Hinze, R.: Efficient generalized folds. In: Jeuring, J. (ed.) Proceedings of the 2nd Workshop on Generic Programming, Ponte de Lima, Portugal, pp. 1\u201316 (July 2000)"},{"key":"8_CR4","unstructured":"Hudak, P., Hughes, J., Peyton Jones, S., Wadler, P.: A history of Haskell: Being lazy with class. In: Proceedings of the Third ACM SIGPLAN Conference on History of Programming Languages, HOPL III, pp. 12\u20131\u201312\u201355. ACM, New York (2007) ISBN 978-1-59593-766-7"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Hughes, J.: Generalising monads to arrows. Science of Computer Programming\u00a037(13), 67\u2013111 (2000) ISSN 0167-6423","DOI":"10.1016\/S0167-6423(99)00023-4"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Jeltsch, W.: Generic record combinators with static type checking. In: Proceedings of the 12th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming, pp. 143\u2013154. ACM (2010)","DOI":"10.1145\/1836089.1836108"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Jones, M.P.: A system of constructor classes: overloading and implicit higher-order polymorphism. Journal of Functional Programming\u00a05, 1\u201335 (1995) ISSN 1469-7653","DOI":"10.1017\/S0956796800001210"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Kiselyov, O., Shan, C.-C.: Lightweight static capabilities. Electron. Notes Theor. Comput. Sci.\u00a0174(7), 79\u2013104 (2007) ISSN 1571-0661","DOI":"10.1016\/j.entcs.2006.10.039"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Kiselyov, O., L\u00e4mmel, R., Schupke, K.: Strongly typed heterogeneous collections. In: Proceedings of the 2004 ACM SIGPLAN Workshop on Haskell, pp. 96\u2013107. ACM (2004)","DOI":"10.1145\/1017472.1017488"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Leroy, X.: Applicative functors and fully transparent higher-order modules. In: Proceedings of the 22Nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1995, pp. 142\u2013153. ACM, New York (1995) ISBN 0-89791-692-1, http:\/\/doi.acm.org\/10.1145\/199448.199476 , doi:10.1145\/199448.199476","DOI":"10.1145\/199448.199476"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"L\u00f6h, A., Hinze, R.: Open data types and open functions. In: Proceedings of the 8th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming, PPDP 2006, pp. 133\u2013144. ACM, New York (2006) ISBN 1-59593-388-3","DOI":"10.1145\/1140335.1140352"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"McBride, C., Paterson, R.: Applicative programming with effects. J. Funct. Program.\u00a018(1), 1\u201313 (2008) ISSN 0956-7968","DOI":"10.1017\/S0956796807006326"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Pottier, F., Gauthier, N.: Polymorphic typed defunctionalization. In: Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2004, pp. 89\u201398. ACM, New York (2004) ISBN 1-58113-729-X","DOI":"10.1145\/982962.964009"},{"key":"8_CR14","first-page":"717","volume-title":"Proceedings of the ACM Annual Conference, ACM 1972","author":"J.C. Reynolds","year":"1972","unstructured":"Reynolds, J.C.: Definitional interpreters for higher-order programming languages. In: Proceedings of the ACM Annual Conference, ACM 1972, vol.\u00a02, pp. 717\u2013740. ACM, New York (1972)"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Schrijvers, T., Peyton Jones, S., Chakravarty, M., Sulzmann, M.: Type checking with open type functions. In: Proceedings of the 13th ACM SIGPLAN International Conference on Functional Programming, ICFP 2008, pp. 51\u201362. ACM, New York (2008) ISBN 978-1-59593-919-7","DOI":"10.1145\/1411204.1411215"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Swamy, N., Guts, N., Leijen, D., Hicks, M.: Lightweight monadic programming in ML. In: Proceedings of the 16th ACM SIGPLAN International Conference on Functional Programming, ICFP 2011, pp. 15\u201327. ACM, New York (2011) ISBN 978-1-4503-0865-6","DOI":"10.1145\/2034773.2034778"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/978-3-540-70594-9_20","volume-title":"Mathematics of Program Construction","author":"J. Voigtl\u00e4nder","year":"2008","unstructured":"Voigtl\u00e4nder, J.: Asymptotic improvement of computations over free monads. In: Audebaud, P., Paulin-Mohring, C. (eds.) MPC 2008. LNCS, vol.\u00a05133, pp. 388\u2013403. Springer, Heidelberg (2008)"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Wadler, P., Blott, S.: How to make ad-hoc polymorphism less ad hoc. In: Proceedings of the 16th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1989, pp. 60\u201376. ACM, New York (1989) ISBN 0-89791-294-2","DOI":"10.1145\/75277.75283"},{"key":"8_CR19","unstructured":"Yallop, J., Kiselyov, O.: First-class modules: hidden power and tantalizing promises. In: ACM SIGPLAN Workshop on ML, Baltimore, Maryland, United States (September 2010)"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Yorgey, B.A., Weirich, S., Cretin, J., Peyton Jones, S., Vytiniotis, D., Magalh\u00e3es, J.P.: Giving Haskell a promotion. In: Proceedings of the 8th ACM SIGPLAN Workshop on Types in Language Design and Implementation, TLDI 2012, pp. 53\u201366. ACM, New York (2012) ISBN 978-1-4503-1120-5","DOI":"10.1145\/2103786.2103795"}],"container-title":["Lecture Notes in Computer Science","Functional and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07151-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,10]],"date-time":"2019-08-10T14:37:08Z","timestamp":1565447828000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07151-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319071503","9783319071510"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07151-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}