Related lectures (12)
Identity and Change
Explores how assignments affect the equivalence between expressions in programming.
Evaluation strategies and termination
Explores evaluation strategies call by name and call by value.
Reasoning about lists
Covers laws of list concatenation, proof by induction, referential transparency, and structural induction.
Scala Parallel Collections: Basics and Best Practices
Covers Scala parallel collections, writing parallelism-agnostic code, converting collections, set intersection, side-effect operations, and concurrent modifications.
Poisson processes
Covers the properties and construction of Poisson processes from i.i.d. Exp(X) random variables, emphasizing the importance of the process rate and jump time distributions.
Lazy Evaluation
Explores lazy evaluation in functional programming, focusing on Scala's implementation of lazy lists.
Compiler Extension Lab
Covers the Compiler Extension Lab, focusing on adding new functionality to a simple functional language compiler.
Binary Search Trees Operations
Explains binary search tree operations, focusing on insertion, search, and list conversion, with an emphasis on formal verification and debugging.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.