Built site for gh-pages

.nojekyll

@@ -1 +1 @@
-db7703c4
+50b04865

schedule.html

@@ -302,15 +302,15 @@ <h1>Week-By-Week</h1>
 <td>T</td>
 <td>10/24</td>
 <td>Recursive types</td>
-<td><strong>Advised</strong>. Harper 19.1-19.2 and 20.1 (Recursion and Recursive Types).<br> Sections 19.3-19.5 and 20.2-20.4 can be considered supplemental.</td>
+<td><strong>Advised</strong>. Harper 16.1-16.2 and 15.1 (Recursion and Recursive Types).<br> Sections 16.3-16.5 and 15.2-15.4 can be considered supplemental.</td>
 <td></td>
 </tr>
 <tr class="even">
 <td></td>
 <td>R</td>
 <td>10/26</td>
 <td>Parametric polymorphism</td>
-<td><strong>Advised</strong>. Harper 16.1 (Parametric Polymorphism).<br> Sections 16.2-16.3 can be considered supplemental.<br><br> <strong>Recommended</strong>. Harper 17.1 (Abstract Types)<br> Sections 17.2-17.4 can be considered supplemental.</td>
+<td><strong>Advised</strong>. Harper 20.1 (Parametric Polymorphism).<br> Sections 20.2-20.3 can be considered supplemental.<br><br> <strong>Recommended</strong>. Harper 21.1 (Abstract Types)<br> Sections 21.2-21.4 can be considered supplemental.</td>
 <td></td>
 </tr>
 <tr class="odd">

search.json

@@ -125,6 +125,13 @@
     "section": "Religious Observances",
     "text": "Religious Observances\nWe will go by the policy for religious observances set forth by the University:\n\nCampus policy regarding religious observances requires that faculty make every effort to deal reasonably and fairly with all students who, because of religious obligations, have conflicts with scheduled exams, assignments, or required attendance. we will try to accommodate religious conflicts in a reasonable manner. Please check the exam dates and submit all requests for adjustments within the first four weeks of class. See the campus policy regarding religious observances for full details."
   },
+  {
+    "objectID": "schedule.html",
+    "href": "schedule.html",
+    "title": "Schedule",
+    "section": "",
+    "text": "The following schedule lists the topics we will cover and approximately the number of meetings we will spend on each topic. The schedule is tentative. Most likely, some things will change during the semester, and I will revise the schedule as necessary.\nThe Reading column lists the assigned reading for the meeting. You should view the readings as an introduction to spark discussion in class.\nThe Assignment column lists the due date for each assignment.\nThe readings will be classified into the following order of recommendation:\n\nAdvised (i.e., expected, required, and of highest importance) — assigned.\nRecommended (i.e., important but read after previous category) — assigned.\nSupplemental (i.e., additional material for a different perspective) – optional.\nFun (i.e., related fun additional material) – optional.\n\n\nWeek-By-Week\n\n\n\nWeek\n\nDate\nTopic\nReading\nAssignment\n\n\n\n\n1\nT\n8/29\nWelcome and course overview meeting01\n\nPost a note on Piazza to introduce yourself. Review the Course Syllabus.\n\n\n\nR\n8/31\nClassic application: Model checking and counterexample-guided abstraction refinement meeting02 meeting02-hw00 meeting02-slides\nSupplemental. Thomas Ball and Sriram K. Rajamani. The SLAM Project: Debugging System Software via Static Analysis. Symposium on Principles of Programming Languages (POPL), 2002.Supplemental. Thomas Ball and Sriram K. Rajamani. Automatically Validating Temporal Safety Properties of Interfaces. International SPIN Workshop, 2001. Recommended. Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar, and Gregoire Sutre. Lazy Abstraction. Symposium on Principles of Programming Languages (POPL), 2002. Software model checking with counterexample-guided abstraction refinement marked a major milestone in taking automated reasoning techniques into industrial practice.\n\n\n\n2\nT\n9/5\nJudgments and rules\nAdvised. Harper Ch. 1.1; Winskel Ch. 1 and 3.1-3.3. Provides some preliminaries for HW0 (optional depending on your background). Rest of Harper Ch. 1 is helpful but “supplemental” for HW0. Supplemental. Pierce Ch. 2 and 3.1-3.3. Another take on mathematical preliminaries for HW0 (optional depending on your background).\n\n\n\n\nR\n9/7\nJudgments and rules\nAdvised. Harper Ch. 2. It is ok to skim 2.4 and 2.6-2.7 for now.\nHW0 due Fri\n\n\n3\nT\n9/12\nStatics and dynamics\nAdvised. Harper Ch. 3 It is ok to skim 3.3-3.4 for now. Advised. Winskel Ch. 2 Sections 2.1-2.5 defines a big-step operational semantics for a simple imperative language IMP. Then, Section 2.6 sketches a small-step operational semantics.\n\n\n\n\nR\n9/14\nStatics and dynamics\nAdvised. Harper Ch. 4-5 and 7.1-7.2 It is ok to skim 5.4 for now. Recommended. Pierce 3.4 A high-level overview of the three basic approaches to formalizing semantics.\n\n\n\n4\nT\n9/19\nType safety\nAdvised. Harper Ch. 6 and 7.3 About type safety. Supplemental. Pierce 3.5 and Ch. 8 Another take on operational semantics and type safety.\n\n\n\n\nR\n9/21\nType safety\nAdvised. Harper 2.4; Winskel 3.4 and Ch. 4 Revisit induction on derivations.\nHW1 due Fri\n\n\n5\nT\n9/26\nFunctions\nAdvised. Harper 8.1-8.2, 9.1-9.2, and 10.1-10.2 (Functions). Sections 8.3-8.4, 9.3-9.4, and 10.3 can be considered supplemental.\n\n\n\n\nR\n9/28\nFinite data types\nAdvised. Harper Ch. 11.1-11.2 and 12.1-12.3 (Products and Sums). It is ok to skim 11.2 and 12.2-12.3. Section 11.3 can be considered supplemental.\n\n\n\n6\nT\n10/3\nImperative computation\nRecommended. Review Winskel Ch. 2 Supplemental. Harper Ch. 34-35\n\n\n\n\nR\n10/5\nImperative computation\n\nHW2 due Fri\n\n\n7\nT\n10/10\nRecursion\n\n\n\n\n\nR\n10/12\nRecursion\n\n\n\n\n8\nT\n10/17\nDenotational semantics\nAdvised. Winskel Ch. 5\n\n\n\n\nR\n10/19\nDenotational semantics\nAdvised. Winskel Ch. 8 Read for the general concepts, not the details. Supplemental. David Schmidt. Denotational Semantics: A Methodology for Language Development. This is a full textbook on denotational semantics.\n\n\n\n9\nT\n10/24\nRecursive types\nAdvised. Harper 16.1-16.2 and 15.1 (Recursion and Recursive Types). Sections 16.3-16.5 and 15.2-15.4 can be considered supplemental.\n\n\n\n\nR\n10/26\nParametric polymorphism\nAdvised. Harper 20.1 (Parametric Polymorphism). Sections 20.2-20.3 can be considered supplemental. Recommended. Harper 21.1 (Abstract Types) Sections 21.2-21.4 can be considered supplemental.\n\n\n\n10\nT\n10/31\nAxiomatic semantics\n\n\n\n\n\nR\n11/2\nAxiomatic semantics\n\nHW3 due Fri\n\n\n11\nT\n11/7\nVerification-condition generation\n\n\n\n\n\nR\n11/9\nVerification-condition generation\n\n\n\n\n12\nT\n11/14\nAbstract interpretation\n\n\n\n\n\nR\n11/16\nAbstract interpretation\n\n\n\n\n13\nT\n11/21\nNo class: Thanksgiving\n\n\n\n\n\nR\n11/23\nNo class: Thanksgiving\n\n\n\n\n14\nT\n11/28\nResearch application\n\n\n\n\n\nR\n11/30\nResearch application\n\n\n\n\n15\nT\n12/5\nFinal exam review\n\n\n\n\n\nR\n12/7\nFinal exam: evening (time TBD)\n\n\n\n\n16\nT\n12/12\nFinal project presentations\n\n\n\n\n\nR\n12/14\nFinal project presentations\n\n\n\n\n17\nT\n12/19\nFinals week\n\n\n\n\n\n\n\nPost Introduction and Background\nPost a note on Piazza to introduce yourself and tell me about your background.\nWhat’s your background?\n\nComfort with functional programming?\nComfort with mathematical logic and induction?\nExperience with building language tools (interpreters, translators)?\nWhat do you want out of this class?\n\nIf you prefer, you can send a separate private note to me about your background."
+  },
   {
     "objectID": "assignments.html",
     "href": "assignments.html",
@@ -215,12 +222,5 @@
     "title": "Assignments",
     "section": "The Paper",
     "text": "The Paper\nYour write up at the end of the semester should be in the form of a short research paper. The project paper should have an abstract and an introduction describing the tackled problem, its motivation, and a very brief summary of the accomplishment. Then you should write a description of your notations (especially if they are different from what we used in class). Then you continue with the body of the material. The paper should end with a conclusion putting in perspective the accomplishment of the project and mentioning the open problems and with a bibliography of cited papers. Research papers should also have a related work section in which they compare the work with previous research results.\nYou might want to browse the papers from PLDI or POPL. Aside from giving you a number of data points for how the paper should look graphically, reading the electronic editions might help you to find a topic. Extending previously-published work is often not a bad start.\nYour project paper should be ~10 pages, as necessary, while being as concise and concrete as possible. Like your proposal, you will not be graded on length but on how many interesting things you say. You will turn in a PDF as well as your implementation code. You will want to use the LaTeX class file produced by ACM/SIGPLAN."
-  },
-  {
-    "objectID": "schedule.html",
-    "href": "schedule.html",
-    "title": "Schedule",
-    "section": "",
-    "text": "The following schedule lists the topics we will cover and approximately the number of meetings we will spend on each topic. The schedule is tentative. Most likely, some things will change during the semester, and I will revise the schedule as necessary.\nThe Reading column lists the assigned reading for the meeting. You should view the readings as an introduction to spark discussion in class.\nThe Assignment column lists the due date for each assignment.\nThe readings will be classified into the following order of recommendation:\n\nAdvised (i.e., expected, required, and of highest importance) — assigned.\nRecommended (i.e., important but read after previous category) — assigned.\nSupplemental (i.e., additional material for a different perspective) – optional.\nFun (i.e., related fun additional material) – optional.\n\n\nWeek-By-Week\n\n\n\nWeek\n\nDate\nTopic\nReading\nAssignment\n\n\n\n\n1\nT\n8/29\nWelcome and course overview meeting01\n\nPost a note on Piazza to introduce yourself. Review the Course Syllabus.\n\n\n\nR\n8/31\nClassic application: Model checking and counterexample-guided abstraction refinement meeting02 meeting02-hw00 meeting02-slides\nSupplemental. Thomas Ball and Sriram K. Rajamani. The SLAM Project: Debugging System Software via Static Analysis. Symposium on Principles of Programming Languages (POPL), 2002.Supplemental. Thomas Ball and Sriram K. Rajamani. Automatically Validating Temporal Safety Properties of Interfaces. International SPIN Workshop, 2001. Recommended. Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar, and Gregoire Sutre. Lazy Abstraction. Symposium on Principles of Programming Languages (POPL), 2002. Software model checking with counterexample-guided abstraction refinement marked a major milestone in taking automated reasoning techniques into industrial practice.\n\n\n\n2\nT\n9/5\nJudgments and rules\nAdvised. Harper Ch. 1.1; Winskel Ch. 1 and 3.1-3.3. Provides some preliminaries for HW0 (optional depending on your background). Rest of Harper Ch. 1 is helpful but “supplemental” for HW0. Supplemental. Pierce Ch. 2 and 3.1-3.3. Another take on mathematical preliminaries for HW0 (optional depending on your background).\n\n\n\n\nR\n9/7\nJudgments and rules\nAdvised. Harper Ch. 2. It is ok to skim 2.4 and 2.6-2.7 for now.\nHW0 due Fri\n\n\n3\nT\n9/12\nStatics and dynamics\nAdvised. Harper Ch. 3 It is ok to skim 3.3-3.4 for now. Advised. Winskel Ch. 2 Sections 2.1-2.5 defines a big-step operational semantics for a simple imperative language IMP. Then, Section 2.6 sketches a small-step operational semantics.\n\n\n\n\nR\n9/14\nStatics and dynamics\nAdvised. Harper Ch. 4-5 and 7.1-7.2 It is ok to skim 5.4 for now. Recommended. Pierce 3.4 A high-level overview of the three basic approaches to formalizing semantics.\n\n\n\n4\nT\n9/19\nType safety\nAdvised. Harper Ch. 6 and 7.3 About type safety. Supplemental. Pierce 3.5 and Ch. 8 Another take on operational semantics and type safety.\n\n\n\n\nR\n9/21\nType safety\nAdvised. Harper 2.4; Winskel 3.4 and Ch. 4 Revisit induction on derivations.\nHW1 due Fri\n\n\n5\nT\n9/26\nFunctions\nAdvised. Harper 8.1-8.2, 9.1-9.2, and 10.1-10.2 (Functions). Sections 8.3-8.4, 9.3-9.4, and 10.3 can be considered supplemental.\n\n\n\n\nR\n9/28\nFinite data types\nAdvised. Harper Ch. 11.1-11.2 and 12.1-12.3 (Products and Sums). It is ok to skim 11.2 and 12.2-12.3. Section 11.3 can be considered supplemental.\n\n\n\n6\nT\n10/3\nImperative computation\nRecommended. Review Winskel Ch. 2 Supplemental. Harper Ch. 34-35\n\n\n\n\nR\n10/5\nImperative computation\n\nHW2 due Fri\n\n\n7\nT\n10/10\nRecursion\n\n\n\n\n\nR\n10/12\nRecursion\n\n\n\n\n8\nT\n10/17\nDenotational semantics\nAdvised. Winskel Ch. 5\n\n\n\n\nR\n10/19\nDenotational semantics\nAdvised. Winskel Ch. 8 Read for the general concepts, not the details. Supplemental. David Schmidt. Denotational Semantics: A Methodology for Language Development. This is a full textbook on denotational semantics.\n\n\n\n9\nT\n10/24\nRecursive types\nAdvised. Harper 19.1-19.2 and 20.1 (Recursion and Recursive Types). Sections 19.3-19.5 and 20.2-20.4 can be considered supplemental.\n\n\n\n\nR\n10/26\nParametric polymorphism\nAdvised. Harper 16.1 (Parametric Polymorphism). Sections 16.2-16.3 can be considered supplemental. Recommended. Harper 17.1 (Abstract Types) Sections 17.2-17.4 can be considered supplemental.\n\n\n\n10\nT\n10/31\nAxiomatic semantics\n\n\n\n\n\nR\n11/2\nAxiomatic semantics\n\nHW3 due Fri\n\n\n11\nT\n11/7\nVerification-condition generation\n\n\n\n\n\nR\n11/9\nVerification-condition generation\n\n\n\n\n12\nT\n11/14\nAbstract interpretation\n\n\n\n\n\nR\n11/16\nAbstract interpretation\n\n\n\n\n13\nT\n11/21\nNo class: Thanksgiving\n\n\n\n\n\nR\n11/23\nNo class: Thanksgiving\n\n\n\n\n14\nT\n11/28\nResearch application\n\n\n\n\n\nR\n11/30\nResearch application\n\n\n\n\n15\nT\n12/5\nFinal exam review\n\n\n\n\n\nR\n12/7\nFinal exam: evening (time TBD)\n\n\n\n\n16\nT\n12/12\nFinal project presentations\n\n\n\n\n\nR\n12/14\nFinal project presentations\n\n\n\n\n17\nT\n12/19\nFinals week\n\n\n\n\n\n\n\nPost Introduction and Background\nPost a note on Piazza to introduce yourself and tell me about your background.\nWhat’s your background?\n\nComfort with functional programming?\nComfort with mathematical logic and induction?\nExperience with building language tools (interpreters, translators)?\nWhat do you want out of this class?\n\nIf you prefer, you can send a separate private note to me about your background."
   }
 ]

sitemap.xml

@@ -2,14 +2,14 @@
 <urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9">
   <url>
     <loc>https://csci5535.cs.colorado.edu/f23/index.html</loc>
-    <lastmod>2023-10-16T21:59:56.283Z</lastmod>
+    <lastmod>2023-10-19T23:13:51.586Z</lastmod>
   </url>
   <url>
-    <loc>https://csci5535.cs.colorado.edu/f23/assignments.html</loc>
-    <lastmod>2023-10-16T21:59:54.083Z</lastmod>
+    <loc>https://csci5535.cs.colorado.edu/f23/schedule.html</loc>
+    <lastmod>2023-10-19T23:13:49.730Z</lastmod>
   </url>
   <url>
-    <loc>https://csci5535.cs.colorado.edu/f23/schedule.html</loc>
-    <lastmod>2023-10-16T21:59:55.295Z</lastmod>
+    <loc>https://csci5535.cs.colorado.edu/f23/assignments.html</loc>
+    <lastmod>2023-10-19T23:13:50.750Z</lastmod>
   </url>
 </urlset>