Lecture

Evaluation strategies and termination

Related lectures (30)

Functional Programming: Concepts and Implementation

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

Programming Paradigms: Functional, OOP, Polymorphism

Explores programming paradigms like procedural, functional, and OOP, with examples in Python.

Programming Models: Overview and Examples

Explores programming models for big data processing, including Spark's RDDs and optimizations.

Stainless Verification System Tutorial

Introduces Stainless, an open-source tool for verifying Scala programs, covering language, modeling, verification tips, and inner workings.

Functional Programming Basics in Scala

Covers the basics of functional programming in Scala, including evaluation strategies, conditionals, and value definitions, with a focus on computing square roots with Newton's method.

Elements of Programming

Covers primitive expressions, evaluation processes, function applications, types, and evaluation strategies in programming.

Functional Programming Principles

Covers the principles and benefits of functional programming, emphasizing immutable data and functions.

Lazy Evaluation: Lazy Lists

Explores lazy evaluation and lazy lists in Scala, emphasizing their benefits and implementation.

Lazy Evaluation

Explores lazy evaluation in functional programming, focusing on Scala's implementation of lazy lists.

Blocks and Lexical Scopes

Explores nested functions, blocks, visibility rules, and lexical scoping in Scala.

Safe Mutation in Practice

Explores safe mutation in functional programming through lazy evaluation, object invariants, and efficient caching functions.

Method Calls: Evaluation and Examples

Explains method aspects, calls, arguments, evaluation, and return values.

Compiler Extension Lab

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

Lazy Lists: Delayed Evaluation and Efficient Computation

Covers Lazy Lists, delaying computation for efficiency in combinatorial search.

Termination Analysis using Dependency Pairs

Explores automated termination analysis using dependency pairs, covering classical and modern techniques, annual competitions, and tools like AProVE.

Prefix, Infix, Postfix and Code Generation

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

Numerics for Fluids, Structures and Electromagnetics: Projects Rules

Students in 'Numerics for Fluids, Structures and Electromagnetics' must complete projects individually or in pairs, following specific rules and evaluation criteria.

Functional Decomposition: Pattern Matching

Covers functional decomposition with pattern matching in Scala to access heterogeneous data in a class hierarchy.

Identity and Change

Explores how assignments affect the equivalence between expressions in programming.

Discrete Event Simulation

Covers discrete event simulation using digital circuits, base components, complex components, and simulation implementation.