Difference between revisions of "CS522 - Programming Language Semantics (Fall 2018)"
(→Lecture Notes, Useful Material) |
(→Lecture Notes, Useful Material) |
||
Line 30: | Line 30: | ||
| The following exercises are from the book material above. Do them only in Maude (that is, ''not'' on paper) by modifying {{zip|CS522-Fall-2018-Maude-HW1.zip|the provided Maude code for HW1}}): Exercise 56 (page 137); Exercise 70 (page 155). | | The following exercises are from the book material above. Do them only in Maude (that is, ''not'' on paper) by modifying {{zip|CS522-Fall-2018-Maude-HW1.zip|the provided Maude code for HW1}}): Exercise 56 (page 137); Exercise 70 (page 155). | ||
In case you are not familiar with Maude, you are encouraged to do the following exercises to warm-up (but please do not include them as part of your HW1 submission): Exercise 30; Exercise 32; Exercise 33; Exercise 35; Exercise 36. All at pages 80/81. | In case you are not familiar with Maude, you are encouraged to do the following exercises to warm-up (but please do not include them as part of your HW1 submission): Exercise 30; Exercise 32; Exercise 33; Exercise 35; Exercise 36. All at pages 80/81. | ||
+ | |} | ||
+ | {| border="1" cellpadding="5" cellspacing="0" width="100%" | ||
+ | ! style="background:#ccddcc;" align="left" | '''''<font color=red>HW2 (due Wednesday, October 3 - easy HW, so earlier submission possible and appreciated)</font>''''' [[Image:downarrow.png]] | ||
+ | |- | ||
+ | | The following exercises related to denotational semantics are from the book material above: Exercises 80, 81, 82 ((page 168; write these up on paper, or in a PDF); Exercise 83 (page 169; do it only in Maude (that is, ''not'' on paper) by modifying {{zip|CS522-Fall-2018-Maude-HW2.zip|the provided Maude code for HW2}}). | ||
|} | |} | ||
:* '''''Lambda Calculus and Combinatory Logic''''' | :* '''''Lambda Calculus and Combinatory Logic''''' |
Revision as of 07:56, 27 September 2018
Students enrolled in this class are expected to check this web page regularly. Lecture notes and important other material will be posted here.
Course Description
CS522 is an advanced course on semantics of programming languages. Various semantic approaches and related aspects will be defined and investigated. Executable semantics of various programming languages and paradigms will be discussed, together with major theoretical models.
- Meetings: Tu/Th 9:30 - 10:45, 1103 Siebel Center
- Professor: Grigore Rosu (Office: SC 2110, WWW: http://fsl.cs.illinois.edu/grosu, Email: grosu@illinois.edu)
- Office hours: By appointment, very flexible (held by Grigore Rosu in SC 2110)
Piazza Page
Lecture Notes, Useful Material
The links below provide you with useful material for this class, including complete lecture notes. These materials will be added by need and more topics will be added.
- Conventional Semantic Approaches
- Slides (PDF) Slides (PPTX) (incomplete)
- Book material on IMP, Big-Step SOS, Small-Step SOS, and Denotational Semantics
- Rewriting Logic and Maude
- slides - recommended only for a quick look
- Book material - recommended
HW1 (due Tuesday, September 18) |
---|
The following exercises are from the book material above. Do them only in Maude (that is, not on paper) by modifying the provided Maude code for HW1 ): Exercise 56 (page 137); Exercise 70 (page 155).
In case you are not familiar with Maude, you are encouraged to do the following exercises to warm-up (but please do not include them as part of your HW1 submission): Exercise 30; Exercise 32; Exercise 33; Exercise 35; Exercise 36. All at pages 80/81. |
HW2 (due Wednesday, October 3 - easy HW, so earlier submission possible and appreciated) |
---|
The following exercises related to denotational semantics are from the book material above: Exercises 80, 81, 82 ((page 168; write these up on paper, or in a PDF); Exercise 83 (page 169; do it only in Maude (that is, not on paper) by modifying the provided Maude code for HW2 ). |
- Lambda Calculus and Combinatory Logic
- Simply-Typed Lambda Calculus
- Category theory: definition, diagrams, cones and limits, exponentials.
- Cartesian Closed Categories as models for simply-typed lambda-calculus.
- Recursion, Types, Polymorphism
- Recursion and Types.
- Polymorphism.