Concept
Fold (higher-order function)
Related lectures (47)
Lazy Lists: Delayed Evaluation and Efficient Computation
Covers Lazy Lists, delaying computation for efficiency in combinatorial search.
Stainless Tutorial: Verification of Scala Code
Covers the use of Stainless, a verification tool for Scala, to ensure the correctness of Scala code.
Church Numerals and Conditionals
Explores Church numerals and encoding conditionals in lambda calculus.
A Closer Look at Lists
Covers list construction, methods, and implementations, including exercises and complexity analysis.
Tuples and Generic Methods
Covers the implementation of merge sort in Scala and the parameterization of sort functions.
Polymorphism in Coq: Data Structures and Functions
Covers polymorphism in Coq, focusing on data structures and functions like lists, length, and append.
Reasoning about lists
Covers laws of list concatenation, proof by induction, referential transparency, and structural induction.
Polymorphism: Cons-Lists
Covers the concept of polymorphism in programming and the implementation of immutable linked lists in Scala.
Data-Parallel Operations: Part 1
Explores data-parallel operations in Scala, converting collections, implementing sum, and examining fold operations.
Parallel Programming: Splitters and Combiners
Covers Splitters and Combiners in parallel programming using Scala, explaining how to implement key methods efficiently.