Skip to content
Snippets Groups Projects
Commit 2f7ae6c0 authored by Matt Bovel's avatar Matt Bovel
Browse files

Add missing parentheses

parent a09ed093
No related branches found
No related tags found
No related merge requests found
......@@ -43,17 +43,17 @@ repository and run `code . ` inside as usual: [`git clone https://gitlab.epfl.ch
| Week | Date | Topic | Videos & Slides |
| :-- | :-- | :-- | :-- |
| 1 | 22.09.2021 | Intro class | Introduction ([Video][Video 1.1.1], [Slides][Slides 1.1.1])<br/>Elements of programming ([Video][Video 1.1.2], [Slides][Slides 1.1.2])<br/>Evaluation strategies and termination ([Video][Video 1.1.3], [Slides][Slides 1.1.3])<br/>Value Definitions and Conditionals ([Video][Video 1.1.4], [Slides][Slides 1.1.4])<br/>Square Roots with Newtons Methods ([Video][Video 1.1.5], [Slides][Slides 1.1.5])<br/>Blocks and lexical scopes ([Video][Video 1.1.6], [Slides][Slides 1.1.6])<br/>Tail Recursion ([Video][Video 1.1.7], [Slides][Slides 1.1.7]) |
| 2 | 29.09.2021 | Recursion / Function values | Higher-Order Functions ([Video][Video 1.2.1], [Slides][Slides 1.2.1]<br/>Currying ([Video][Video 1.2.2], [Slides][Slides 1.2.2]<br/>Finding FixedPoints ([Video][Video 1.2.3], [Slides][Slides 1.2.3]<br/>Scala Syntax Summary ([Video][Video 1.2.4], [Slides][Slides 1.2.4]<br/>Functions and Data ([Video][Video 1.2.5], [Slides][Slides 1.2.5]<br/>Data Abstraction ([Video][Video 1.2.6], [Slides][Slides 1.2.6]<br/>Evaluation and Operators ([Video][Video 1.2.7], [Slides][Slides 1.2.7]) |
| 3 | 06.09.2021 | Classes | Class Hierarchies ([Video][Video 1.3.1], [Slides][Slides 1.3.1]<br/>How Classes are Organized ([Video][Video 1.3.2], [Slides][Slides 1.3.2]<br/>Polymorphism ([Video][Video 1.3.3], [Slides][Slides 1.3.3]<br/>Objects Everywhere ([Video][Video 1.3.4], [Slides][Slides 1.3.4]<br/>Functions as Objects ([Video][Video 1.3.5], [Slides][Slides 1.3.5]) |
| 4 | 13.10.2021 | Classes | Decomposition ([Video][Video 1.4.1], [Slides][Slides 1.4.1]<br/>Pattern Matching ([Video][Video 1.4.2], [Slides][Slides 1.4.2]<br/>Lists ([Video][Video 1.4.3], [Slides][Slides 1.4.3]<br/>Enums ([Video][Video 1.4.4], [Slides][Slides 1.4.4]<br/>Subtyping and Generics ([Video][Video 1.4.5], [Slides][Slides 1.4.5]<br/>Variance ([Video][Video 1.4.6], [Slides][Slides 1.4.6]) |
| 5 | 20.10.2021 | List | A closer look at lists ([Video][Video 1.5.1], [Slides][Slides 1.5.1]<br/>Tuples and generic methods ([Video][Video 1.5.2], [Slides][Slides 1.5.2]<br/>Higher order list functions ([Video][Video 1.5.3], [Slides][Slides 1.5.3]<br/>Reduction of lists ([Video][Video 1.5.4], [Slides][Slides 1.5.4]<br/>Reasoning about lists ([Video][Video 1.5.5], [Slides][Slides 1.5.5]) |
| 6 | 27.10.2021 | Collection | Other Collections ([Video][Video 1.6.1], [Slides][Slides 1.6.1]<br/>Combinatorial Search and For-Expressions ([Video][Video 1.6.2], [Slides][Slides 1.6.2]<br/>Combinatorial Search Example ([Video][Video 1.6.3], [Slides][Slides 1.6.3]<br/>Maps ([Video][Video 1.6.4], [Slides][Slides 1.6.4]<br/>Putting the Pieces Together ([Video][Video 1.6.5], [Slides][Slides 1.6.5]) |
| 7 | 03.11.2021 | Monads | Recap ([Video][Video 2.1.1], [Slides][Slides 2.1.1]<br/>Queries with for ([Video][Video 2.1.2], [Slides][Slides 2.1.2]<br/>Translation of for ([Video][Video 2.1.3], [Slides][Slides 2.1.3]<br/>Functional Random Generators ([Video][Video 2.1.4], [Slides][Slides 2.1.4]<br/>Monads ([Video][Video 2.1.5], [Slides][Slides 2.1.5]<br/>Exceptional Monads ([Video][Video 2.1.6], [Slides][Slides 2.1.6]) |
| 2 | 29.09.2021 | Recursion / Function values | Higher-Order Functions ([Video][Video 1.2.1], [Slides][Slides 1.2.1])<br/>Currying ([Video][Video 1.2.2], [Slides][Slides 1.2.2])<br/>Finding FixedPoints ([Video][Video 1.2.3], [Slides][Slides 1.2.3])<br/>Scala Syntax Summary ([Video][Video 1.2.4], [Slides][Slides 1.2.4])<br/>Functions and Data ([Video][Video 1.2.5], [Slides][Slides 1.2.5])<br/>Data Abstraction ([Video][Video 1.2.6], [Slides][Slides 1.2.6])<br/>Evaluation and Operators ([Video][Video 1.2.7], [Slides][Slides 1.2.7]) |
| 3 | 06.09.2021 | Classes | Class Hierarchies ([Video][Video 1.3.1], [Slides][Slides 1.3.1])<br/>How Classes are Organized ([Video][Video 1.3.2], [Slides][Slides 1.3.2])<br/>Polymorphism ([Video][Video 1.3.3], [Slides][Slides 1.3.3])<br/>Objects Everywhere ([Video][Video 1.3.4], [Slides][Slides 1.3.4])<br/>Functions as Objects ([Video][Video 1.3.5], [Slides][Slides 1.3.5]) |
| 4 | 13.10.2021 | Classes | Decomposition ([Video][Video 1.4.1], [Slides][Slides 1.4.1])<br/>Pattern Matching ([Video][Video 1.4.2], [Slides][Slides 1.4.2])<br/>Lists ([Video][Video 1.4.3], [Slides][Slides 1.4.3])<br/>Enums ([Video][Video 1.4.4], [Slides][Slides 1.4.4])<br/>Subtyping and Generics ([Video][Video 1.4.5], [Slides][Slides 1.4.5])<br/>Variance ([Video][Video 1.4.6], [Slides][Slides 1.4.6]) |
| 5 | 20.10.2021 | List | A closer look at lists ([Video][Video 1.5.1], [Slides][Slides 1.5.1])<br/>Tuples and generic methods ([Video][Video 1.5.2], [Slides][Slides 1.5.2])<br/>Higher order list functions ([Video][Video 1.5.3], [Slides][Slides 1.5.3])<br/>Reduction of lists ([Video][Video 1.5.4], [Slides][Slides 1.5.4])<br/>Reasoning about lists ([Video][Video 1.5.5], [Slides][Slides 1.5.5]) |
| 6 | 27.10.2021 | Collection | Other Collections ([Video][Video 1.6.1], [Slides][Slides 1.6.1])<br/>Combinatorial Search and For-Expressions ([Video][Video 1.6.2], [Slides][Slides 1.6.2])<br/>Combinatorial Search Example ([Video][Video 1.6.3], [Slides][Slides 1.6.3])<br/>Maps ([Video][Video 1.6.4], [Slides][Slides 1.6.4])<br/>Putting the Pieces Together ([Video][Video 1.6.5], [Slides][Slides 1.6.5]) |
| 7 | 03.11.2021 | Monads | Recap ([Video][Video 2.1.1], [Slides][Slides 2.1.1])<br/>Queries with for ([Video][Video 2.1.2], [Slides][Slides 2.1.2])<br/>Translation of for ([Video][Video 2.1.3], [Slides][Slides 2.1.3])<br/>Functional Random Generators ([Video][Video 2.1.4], [Slides][Slides 2.1.4])<br/>Monads ([Video][Video 2.1.5], [Slides][Slides 2.1.5])<br/>Exceptional Monads ([Video][Video 2.1.6], [Slides][Slides 2.1.6]) |
| 8 | 10.11.2021 | **Midterm exam** | - |
| 9 | 17.11.2021 | Lazy evaluation | Structural Induction on Trees ([Video][Video 2.2.1], [Slides][Slides 2.2.1]<br/>Lazy Lists ([Video][Video 2.2.2], [Slides][Slides 2.2.2]<br/>Lazy Evaluation ([Video][Video 2.2.3], [Slides][Slides 2.2.3]<br/>Infinite Sequences ([Video][Video 2.2.4], [Slides][Slides 2.2.4]<br/>Case Study ([Video][Video 2.2.5], [Slides][Slides 2.2.5]) |
| 10 | 24.11.2021 | Type-directed computation | Contextual abstraction ([Video][Video 2.3.1], [Slides][Slides 2.3.1]<br/>Using clauses and given instances ([Video][Video 2.3.2], [Slides][Slides 2.3.2]<br/>Type classes ([Video][Video 2.3.3], [Slides][Slides 2.3.3]<br/>Abstract algebra and type classes ([Video][Video 2.3.4], [Slides][Slides 2.3.4]<br/>Context passing ([Video][Video 2.3.5], [Slides][Slides 2.3.5]<br/>Implicit function types ([Video][Video 2.3.6], [Slides][Slides 2.3.6]) |
| 11 | 01.12.2021 | State | Functions and state ([Video][Video 2.4.1], [Slides][Slides 2.4.1]<br/>Identity and change ([Video][Video 2.4.2], [Slides][Slides 2.4.2]<br/>Loops ([Video][Video 2.4.3], [Slides][Slides 2.4.3]<br/>Discrete Event Simulation ([Video][Video 2.4.4], [Slides][Slides 2.4.4]) |
| 12 | 08.12.2021 | Interpreter I | Interpreter for Arithmetic ([Video][Video 3.1.1], [Slides][Slides 3.1.1]<br/>Substitution Interpreter for Recursive Functions ([Video][Video 3.1.2], [Slides][Slides 3.1.2]<br/>Environment Instead of Substitutions ([Video][Video 3.1.3], [Slides][Slides 3.1.3]<br/>Higher-Order Functions Using Naive Substitutions ([Video][Video 3.1.4], [Slides][Slides 3.1.4]<br/>Avoiding Variable Capture ([Video][Video 3.1.5], [Slides][Slides 3.1.5]<br/>Higher-Order Functions Using Environments ([Video][Video 3.1.6], [Slides][Slides 3.1.6]<br/>Nested Recursive Definitions ([Video][Video 3.1.7], [Slides][Slides 3.1.7]) |
| 9 | 17.11.2021 | Lazy evaluation | Structural Induction on Trees ([Video][Video 2.2.1], [Slides][Slides 2.2.1])<br/>Lazy Lists ([Video][Video 2.2.2], [Slides][Slides 2.2.2])<br/>Lazy Evaluation ([Video][Video 2.2.3], [Slides][Slides 2.2.3])<br/>Infinite Sequences ([Video][Video 2.2.4], [Slides][Slides 2.2.4])<br/>Case Study ([Video][Video 2.2.5], [Slides][Slides 2.2.5]) |
| 10 | 24.11.2021 | Type-directed computation | Contextual abstraction ([Video][Video 2.3.1], [Slides][Slides 2.3.1])<br/>Using clauses and given instances ([Video][Video 2.3.2], [Slides][Slides 2.3.2])<br/>Type classes ([Video][Video 2.3.3], [Slides][Slides 2.3.3])<br/>Abstract algebra and type classes ([Video][Video 2.3.4], [Slides][Slides 2.3.4])<br/>Context passing ([Video][Video 2.3.5], [Slides][Slides 2.3.5])<br/>Implicit function types ([Video][Video 2.3.6], [Slides][Slides 2.3.6]) |
| 11 | 01.12.2021 | State | Functions and state ([Video][Video 2.4.1], [Slides][Slides 2.4.1])<br/>Identity and change ([Video][Video 2.4.2], [Slides][Slides 2.4.2])<br/>Loops ([Video][Video 2.4.3], [Slides][Slides 2.4.3])<br/>Discrete Event Simulation ([Video][Video 2.4.4], [Slides][Slides 2.4.4]) |
| 12 | 08.12.2021 | Interpreter I | Interpreter for Arithmetic ([Video][Video 3.1.1], [Slides][Slides 3.1.1])<br/>Substitution Interpreter for Recursive Functions ([Video][Video 3.1.2], [Slides][Slides 3.1.2])<br/>Environment Instead of Substitutions ([Video][Video 3.1.3], [Slides][Slides 3.1.3])<br/>Higher-Order Functions Using Naive Substitutions ([Video][Video 3.1.4], [Slides][Slides 3.1.4])<br/>Avoiding Variable Capture ([Video][Video 3.1.5], [Slides][Slides 3.1.5])<br/>Higher-Order Functions Using Environments ([Video][Video 3.1.6], [Slides][Slides 3.1.6])<br/>Nested Recursive Definitions ([Video][Video 3.1.7], [Slides][Slides 3.1.7]) |
| 13 | 15.12.2021 | Parsing with Combinators / Lambda Calculus | Parsing with Combinators ([Video][Video 3.2.1])<br/>Recursion as Self-Application ([Video][Video 3.2.2])<br/>Church Numerals and Conditionals ([Video][Video 3.2.3]) |
| 14 | 22.12.2021 | **Final exam** | - |
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Please register or to comment