Okay, how about this for a summary:
TBA! TBA! TBA!
Wait, what, that’s not enough? Sigh.
Okay, how about this. The basic idea for this course is to review the history of Program Synthesis, the beautiful fiction that the computer can write the program for you.
As you’ll see, there are many different ways of turning this idea into a reality. Nearly all of them are very limited, and much less magical than their inventors probably hoped that they would be. Nevertheless, we’re getting closer to a theory of program synthesis, and there are some fairly impressive results coming out now.
Our plan is to review some of the history of program synthesis by reading and reconstructing the results of a broad swath of papers from the field.
Aaaaand... that’s about all I’m able to say about it right now. Let’s talk more tomorrow!
build simple models of programming language semantics, and
see how these models relate to the languages you use every day.
This is an upper-level course in programming languages, and assumes a familiarity with the principles of programming languages, including but not limited to notions of scope, calling convention, evaluation rules, compound data, and basic typing.
Additionally, students are assumed to have a basic understanding of simple mathematics, including the basics of set theory, very simple algebra, and some experience with proofs and basic mathematical rigor.
Finally, it requires curiosity, and self-driven exploration.
Gulwani, Sumit, Saurabh Srivastava, and Ramarathnam Venkatesan. "Program analysis as constraint solving." Proceedings of the 29th ACM SIGPLAN Conference on Programming Language Design and Implementation. 2008.
Singh, Rishabh, Sumit Gulwani, and Armando Solar-Lezama. "Automated feedback generation for introductory programming assignments." Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation. 2013.
See my Cal Poly Home Page for my calendar, including times & locations of labs, lectures, and office hours. You can add it to your calendar, if that makes your life easier.
John Clements, aoeuclements @ brinckerhoff.org
Lecture: 1400-1600, M/W, room 014-232B
This is the course web page, its link is http://www.brinckerhoff.org/clements/2214-csc530.
You can do your work in this class in any way you want, as long as your team agrees!
This class will use Piazza. This will be the principal means that I’ll use to notify you of deadlines, organizational updates, and changes to assignments. If you’re not keeping up with the group, you’re going to be missing important information.
It’s also the best way for you to direct questions to me and/or the class. Feel free to e-mail me with personal questions, but use the Piazza group as your main means of communication. It’s possible to post anonymously, if you like.
You should already have received an invitation to the Piazza group; let me know if you need an invite.
Don’t post your code or test cases to the group; anything else is fair game.
Also, please keep in mind that I (and everyone else) judge you based in part on your written communication. Spelling, complete sentences, and evidence of forethought are important in all of your posts & e-mails. One easy rule of thumb: just read over what you’ve written before clicking post or send, and imagine others in the class reading it.
I do not formally state attendance requirements.
However, an outrageously large fraction of the grade depends on your class participation; if you don’t show up, you’re unlikely to get a good grade.
There will be no exams in this class.
Grades will be determined by your performance on programming projects, your final project, and your class interaction.
Class Participation: 20%
Paper Presentation: 30%
Final Project: 30%