{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:22:00Z","timestamp":1750306920715,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,3,6]],"date-time":"2013-03-06T00:00:00Z","timestamp":1362528000000},"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":[[2013,3,6]]},"DOI":"10.1145\/2445196.2445274","type":"proceedings-article","created":{"date-parts":[[2013,3,8]],"date-time":"2013-03-08T15:04:00Z","timestamp":1362755040000},"page":"257-262","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["A more formal approach to \"computer science: principles\""],"prefix":"10.1145","author":[{"given":"Rex","family":"Page","sequence":"first","affiliation":[{"name":"University of Oklahoma, Norman, OK, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruben","family":"Gamboa","sequence":"additional","affiliation":[{"name":"University of Wyoming, Laramie, WY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,3,6]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Blown to Bits: Your Life, Liberty, and Happiness After the Digital Explosion","author":"Abelson Hal","year":"2008","unstructured":"Hal Abelson , Ken Ledeen , and Harry Lewis . Blown to Bits: Your Life, Liberty, and Happiness After the Digital Explosion . Addison-Wesley Professional , 2008 . Hal Abelson, Ken Ledeen, and Harry Lewis. Blown to Bits: Your Life, Liberty, and Happiness After the Digital Explosion. Addison-Wesley Professional, 2008."},{"key":"e_1_3_2_1_2_1","volume-title":"Proceedings of the Tenth International Workshop of the ACL2 Theorem Prover and its Applications (ACL2--2011)","author":"Chamarthi Harsh","year":"2011","unstructured":"Harsh Chamarthi , Peter Dillinger , Matt Kaufmann , and Panagiotis Manolios . Interactive testing and interactive theorem proving . In Proceedings of the Tenth International Workshop of the ACL2 Theorem Prover and its Applications (ACL2--2011) , 2011 . Harsh Chamarthi, Peter Dillinger, Matt Kaufmann, and Panagiotis Manolios. Interactive testing and interactive theorem proving. In Proceedings of the Tenth International Workshop of the ACL2 Theorem Prover and its Applications (ACL2--2011), 2011."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/792548.611966"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1637837.1637844"},{"key":"e_1_3_2_1_6_1","volume-title":"Proceedings of the Seventh International Workshop of the ACL2 Theorem Prover and its Applications (ACL2--2007)","author":"Eastlund Carl","year":"2007","unstructured":"Carl Eastlund , Dale Vaillancourt , and Matthias Felleisen . ACL2 for freshmen : First experiences . In Proceedings of the Seventh International Workshop of the ACL2 Theorem Prover and its Applications (ACL2--2007) , 2007 . Carl Eastlund, Dale Vaillancourt, and Matthias Felleisen. ACL2 for freshmen: First experiences. In Proceedings of the Seventh International Workshop of the ACL2 Theorem Prover and its Applications (ACL2--2007), 2007."},{"key":"e_1_3_2_1_7_1","unstructured":"Matthias Felleisen. The first year. http:\/\/www.ccs.neu.edu\/home\/matthias\/Presentations\/FirstYear\/first%20year.pdf.  Matthias Felleisen. The first year. http:\/\/www.ccs.neu.edu\/home\/matthias\/Presentations\/FirstYear\/first%20year.pdf."},{"key":"e_1_3_2_1_8_1","volume-title":"Matthew Flatt, and Shriram Krishnamurthi. How to Design Programs: An Introduction to Programming and Computing","author":"Felleisen Matthias","year":"2001","unstructured":"Matthias Felleisen , Robert Bruce Findler , Matthew Flatt, and Shriram Krishnamurthi. How to Design Programs: An Introduction to Programming and Computing . MIT Press , Boston , 2001 . Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, and Shriram Krishnamurthi. How to Design Programs: An Introduction to Programming and Computing. MIT Press, Boston, 2001."},{"key":"e_1_3_2_1_9_1","volume-title":"Constructionism 2010","author":"Harvey Brian","year":"2010","unstructured":"Brian Harvey and Jens M\u00f6nig . Bringing \"no ceiling\" to scratch : Can one language serve kids and computer scientists ? In Constructionism 2010 ( Paris) , 2010 . Brian Harvey and Jens M\u00f6nig. Bringing \"no ceiling\" to scratch: Can one language serve kids and computer scientists? In Constructionism 2010 (Paris), 2010."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8535.2011.01241.x"},{"key":"e_1_3_2_1_11_1","volume-title":"Sept.","author":"Joint Task Force on Computing Curricula.","year":"2001","unstructured":"Joint Task Force on Computing Curricula. Computing curricula 2001 computer science. Journal of Educational Resources in Computing (JERIC), 1(3es) , Sept. 2001 . Joint Task Force on Computing Curricula. Computing curricula 2001 computer science. Journal of Educational Resources in Computing (JERIC), 1(3es), Sept. 2001."},{"key":"e_1_3_2_1_12_1","volume-title":"Computer-Aided Reasoning: An Approach","author":"Kaufmann Matt","year":"2000","unstructured":"Matt Kaufmann , Panagiotis Manolios , and J Strother Moore . Computer-Aided Reasoning: An Approach . Kluwer Academic Press , 2000 . Matt Kaufmann, Panagiotis Manolios, and J Strother Moore. Computer-Aided Reasoning: An Approach. Kluwer Academic Press, 2000."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/382063.803374"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1773912.1773922"},{"key":"e_1_3_2_1_15_1","unstructured":"The College Board. Computer science: Principles. http:\/\/www.collegeboard.com\/prod\\_downloads\/computerscience\/ComputationalThinkingCS_Principles.pdf 2011.  The College Board. Computer science: Principles. http:\/\/www.collegeboard.com\/prod\\_downloads\/computerscience\/ComputationalThinkingCS_Principles.pdf 2011."},{"key":"e_1_3_2_1_16_1","unstructured":"The College Board. CS principles pilot sites. http:\/\/www.csprinciples.org\/home\/pilot-sites 2012.  The College Board. CS principles pilot sites. http:\/\/www.csprinciples.org\/home\/pilot-sites 2012."},{"issue":"4","key":"e_1_3_2_1_17_1","first-page":"86","article-title":"Teaching recursion before loops in CS1","volume":"14","author":"Turbak Franklyn","year":"1999","unstructured":"Franklyn Turbak , Constance Royden , Jennifer Stephan , and Jean Herbst . Teaching recursion before loops in CS1 . The Journal of Computing in Small Colleges , 14 ( 4 ): 86 -- 101 , 1999 . Franklyn Turbak, Constance Royden, Jennifer Stephan, and Jean Herbst. Teaching recursion before loops in CS1. The Journal of Computing in Small Colleges, 14(4):86--101, 1999.","journal-title":"The Journal of Computing in Small Colleges"}],"event":{"name":"SIGCSE '13: The 44th ACM Technical Symposium on Computer Science Education","sponsor":["SIGCSE ACM Special Interest Group on Computer Science Education"],"location":"Denver Colorado USA","acronym":"SIGCSE '13"},"container-title":["Proceeding of the 44th ACM technical symposium on Computer science education"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2445196.2445274","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2445196.2445274","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:35:20Z","timestamp":1750235720000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2445196.2445274"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,6]]},"references-count":17,"alternative-id":["10.1145\/2445196.2445274","10.1145\/2445196"],"URL":"https:\/\/doi.org\/10.1145\/2445196.2445274","relation":{},"subject":[],"published":{"date-parts":[[2013,3,6]]},"assertion":[{"value":"2013-03-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}