Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers the fundamental elements of programming, including primitive expressions, ways to combine expressions, and ways to abstract expressions. It introduces the Read-Eval-Print Loop (REPL) in Scala, explains the evaluation process of non-primitive expressions, and demonstrates the evaluation of arithmetic expressions and function applications. The lecture also discusses parameter and return types, the substitution model for expression evaluation, termination in evaluation, and different evaluation strategies such as call-by-name and call-by-value.