Difference between revisions of "CS522 - Programming Language Semantics (Fall 2018)"
From FSL
(→Lecture Notes, Useful Material) |
(→Lecture Notes, Useful Material) |
||
Line 20: | Line 20: | ||
:* '''''Conventional Semantic Approaches''''' | :* '''''Conventional Semantic Approaches''''' | ||
− | ::* {{pdf|CS522-Fall-2018-Conventional-Executable-Semantics.pdf|Slides (PDF)}} {{ | + | ::* {{pdf|CS522-Fall-2018-Conventional-Executable-Semantics.pdf|Slides (PDF)}} {{ppt|CS522-Fall-2018-Conventional-Executable-Semantics.pptx|Slides (PPTX)}} <font color=red>(incomplete)</font> |
::* '''''Rewriting Logic and Maude''''' | ::* '''''Rewriting Logic and Maude''''' | ||
Revision as of 13:58, 30 August 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: W/F 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)
- Rewriting Logic and Maude
- 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.