Tail call

Related lectures (25)

Page 2 of 3

Explores recursion, fixpoints, and procedures in depth, emphasizing understanding recursive functions.

Covers the implementation of recursive functions using substitutions and environments, showcasing the ability to execute computable functions.

Covers the moving average filter and its transition to a first-order recursion.

Introduces functions in Python, covering predefined and user-defined functions, formal and effective parameters, and the importance of docstrings.

Covers modeling control statements with functions in Scala, including while loops, repeat loops, and for-loops translation.

Explores approximating loops and defining recursive programs mathematically.

Explores chaos in quantum field theories, focusing on conformal symmetry, OPE coefficients, and random matrix universality.

Focuses on using Stainless for program verification, demonstrating the process of verifying programs and ensuring correctness.

Explores prefix, infix, and postfix notations in expressions and their role in code generation.

Explores the recursive version of insertion sort algorithm, emphasizing recursion and dynamic programming concepts.