"Lec 3 - Programming by Sketching" (October 9, 2009) Ras Bodik, from UC Berkeley Computer Science, discusses how partial programs can communicate programmer insight, how suitable synthesis algorithm completes the mechanics, and how end-user programming may be decomposable into partial program completion. Stanford University: http://www.stanford.edu/ Stanford Engineering Everywhere: http://see.stanford.edu/ Stanford Channel on YouTube: http://www.youtube.com/stanford
Video is embedded from external source so embedding is not available.
Video is embedded from external source so download is not available.
Channels: Computer Science
Tags: computer science technology humanities internet creation application online industry interface design language program tool game playing agent system algorithm aLisp synthesizer performance constraint solving input scalable code file
Duration: 63m 23s
No content is added to this lecture.
This video is a part of a lecture series from of stanford