{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:34:43Z","timestamp":1750307683079,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,9,21]],"date-time":"2008-09-21T00:00:00Z","timestamp":1221955200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,9,21]]},"DOI":"10.1145\/1411260.1411263","type":"proceedings-article","created":{"date-parts":[[2008,9,23]],"date-time":"2008-09-23T13:39:01Z","timestamp":1222177141000},"page":"13-20","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["The chilling descent"],"prefix":"10.1145","author":[{"given":"Prabhakar","family":"Ragde","sequence":"first","affiliation":[{"name":"University of Waterloo, Waterloo, ON, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,9,21]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Structure and Interpretation of Computer Programs","author":"Abelson H.","year":"1996","unstructured":"Abelson , H. , Sussman , G. J. , and Sussman , J. , Structure and Interpretation of Computer Programs ( second edition), MIT Press , 1996 . Abelson, H., Sussman, G. J., and Sussman, J., Structure and Interpretation of Computer Programs (second edition), MIT Press, 1996."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/359080.359083"},{"key":"e_1_3_2_1_3_1","first-page":"60","volume-title":"Proceedings of the 1993 Workshop on Algorithms and Data Structures (WADS)","author":"Andersson A.","year":"1993","unstructured":"Andersson , A. , \" Balanced search trees made simple \", Proceedings of the 1993 Workshop on Algorithms and Data Structures (WADS) , pp. 60 -- 71 , Montr\u00e9al, Canada , 1993 . Andersson, A., \"Balanced search trees made simple\", Proceedings of the 1993 Workshop on Algorithms and Data Structures (WADS), pp. 60--71, Montr\u00e9al, Canada, 1993."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/277651.277660"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796803004805"},{"key":"e_1_3_2_1_6_1","volume-title":"Introduction to Algorithms","author":"Cormen T.","year":"2001","unstructured":"Cormen , T. , Leiserson , C. , Rivest , R. , and Stein , C. , Introduction to Algorithms ( 2 nd edition), MIT Press , 2001 . Cormen, T., Leiserson, C., Rivest, R., and Stein, C., Introduction to Algorithms (2nd edition), MIT Press, 2001.","edition":"2"},{"key":"e_1_3_2_1_7_1","volume-title":"Computer Science Department","author":"Crane C. T.","year":"1972","unstructured":"Crane , C. T. , \" Linear lists and priority queues as balanced binary trees\", PhD thesis (STAN-CS-72-259) , Computer Science Department , Stanford University , February 1972 . Crane, C. T., \"Linear lists and priority queues as balanced binary trees\", PhD thesis (STAN-CS-72-259), Computer Science Department, Stanford University, February 1972."},{"key":"e_1_3_2_1_8_1","volume-title":"The Scheme Programming Language","author":"Dybvig R. K.","year":"2003","unstructured":"Dybvig , R. K. , The Scheme Programming Language ( 3 rd edition), MIT Press , 2003 . Dybvig, R. K., The Scheme Programming Language (3rd edition), MIT Press, 2003.","edition":"3"},{"key":"e_1_3_2_1_9_1","volume-title":"How To Design Programs","author":"Felleisen M.","year":"2003","unstructured":"Felleisen , M. , Findler , R. , Flatt , M. , and Krishnamurthi , S. , How To Design Programs , MIT Press , 2003 . Felleisen, M., Findler, R., Flatt, M., and Krishnamurthi, S., How To Design Programs, MIT Press, 2003."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796804005076"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90014-7"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(95)00003-8"},{"key":"e_1_3_2_1_13_1","volume-title":"Data Structures and Algorithms in Java","author":"Goodrich M.","year":"2005","unstructured":"Goodrich , M. , and Tamassia , R. , Data Structures and Algorithms in Java , John Wiley & amp; Sons, 2005 . Goodrich, M., and Tamassia, R., Data Structures and Algorithms in Java, John Wiley & Sons, 2005."},{"key":"e_1_3_2_1_14_1","volume-title":"Functional C","author":"Hartel P.","year":"1997","unstructured":"Hartel , P. , and Muller , H. , Functional C , Addison-Wesley , 1997 . Hartel, P., and Muller, H., Functional C, Addison-Wesley, 1997."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010051815785"},{"key":"e_1_3_2_1_16_1","volume-title":"C Programming: A Modern Approach","author":"King K. N.","year":"2008","unstructured":"King , K. N. , C Programming: A Modern Approach ( second edition), W. W. Norton , 2008 . King, K. N., C Programming: A Modern Approach (second edition), W. W. Norton, 2008."},{"key":"e_1_3_2_1_17_1","volume-title":"Algorithm Design","author":"Kleinberg J.","year":"2005","unstructured":"Kleinberg , J. , and Tardos , E. , Algorithm Design , Addison-Wesley , 2005 . Kleinberg, J., and Tardos, E., Algorithm Design, Addison-Wesley, 2005."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/0222058"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796897002876"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796899003494"},{"key":"e_1_3_2_1_21_1","first-page":"77","volume-title":"Proceedings of the 1998 ACM SIGPLAN Workshop on ML","author":"Okasaki C.","year":"1998","unstructured":"Okasaki , C. , and Gill , A ., \" Fast mergeable integer maps \", Proceedings of the 1998 ACM SIGPLAN Workshop on ML , Baltimore, MD , pp. 77 -- 86 , 1998 . Okasaki, C., and Gill, A., \"Fast mergeable integer maps\", Proceedings of the 1998 ACM SIGPLAN Workshop on ML, Baltimore, MD, pp. 77--86, 1998."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1124706.1121431"},{"key":"e_1_3_2_1_23_1","volume-title":"Mark Twain At Work","author":"Bernard de Voto","year":"1942","unstructured":"Bernard de Voto , Mark Twain At Work , Cambridge University Press , 1942 . Bernard de Voto, Mark Twain At Work, Cambridge University Press, 1942."},{"key":"e_1_3_2_1_24_1","volume-title":"Data Structures and Algorithm Analysis in C++","author":"Weiss M. A.","year":"2007","unstructured":"Weiss , M. A. , Data Structures and Algorithm Analysis in C++ , Addison-Wesley , 2007 . Weiss, M. A., Data Structures and Algorithm Analysis in C++, Addison-Wesley, 2007."}],"event":{"name":"ICFP08: ACM SIGPLAN International Conference on Functional Programming","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery"],"location":"Victoria BC Canada","acronym":"ICFP08"},"container-title":["Proceedings of the 2008 international workshop on Functional and declarative programming in education"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1411260.1411263","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1411260.1411263","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:29:47Z","timestamp":1750253387000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1411260.1411263"}},"subtitle":["making the transition to a conventional curriculum"],"short-title":[],"issued":{"date-parts":[[2008,9,21]]},"references-count":24,"alternative-id":["10.1145\/1411260.1411263","10.1145\/1411260"],"URL":"https:\/\/doi.org\/10.1145\/1411260.1411263","relation":{},"subject":[],"published":{"date-parts":[[2008,9,21]]},"assertion":[{"value":"2008-09-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}