Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Tail call

Related lectures (25)

Functional Programming: Concepts and Implementation

Covers the concepts and implementation of functional programming in Scala, emphasizing functions, immutable data, and data abstraction.

Functions: Reusability and Error Reduction

Covers functions in C programming, emphasizing reusability and error reduction through proper function structure.

Function Evaluation: Basics

Explains the three main aspects of a function and its evaluation process.

Tail Recursion

Covers tail recursion, optimizing functions in Scala for iterative processes and providing examples like tail-recursive factorial.

Compiler Extension Lab

Covers the Compiler Extension Lab, focusing on adding new functionality to a simple functional language compiler.

Functions as Objects

Covers the expansion of function values and calls, and the relationship between functions and methods.

Effects of Array Overflow

Explores the impact of array overflow on function calls and memory allocation in C++.

Recursion: Understanding Recursive Functions

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

Recursive Functions: Substitution Interpreter

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

The moving average filter

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

Functions in Python

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

Loops: Control Statements and Functions

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

Approximating Loops: Recursion

Explores approximating loops and defining recursive programs mathematically.

Verifying Programs with Stainless: Part 2

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

Prefix, Infix, Postfix and Code Generation

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

Recursive Insertion Sort Strategies

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

Model Interpretation and Compilation

Explores model interpretation, compilation via partial evaluation, function calls, and the transition to partial evaluation, emphasizing the importance of model interpreters in supporting modeling languages.

Default Arguments and Function Overloading

Explains default arguments in function prototypes and function overloading in C++.

Designing Algorithms: Recursion and Dynamic Programming

Explores designing algorithms with recursion and dynamic programming, covering concepts like the Towers of Hanoi and efficient solutions.

Dynamic Programming: Solving Sequential Problems Efficiently

Explores dynamic programming for efficient problem-solving, illustrated with binomial coefficients and Pascal's triangle.