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

Lecture

Records and Variants

In course

CS-452: Foundations of software

The course introduces the foundations on which programs and programming languages are built. It introduces syntax, types and semantics as building blocks that together define the properties of a program part or a language. Students will learn how to apply ...

Description

This lecture covers the concepts of options, variants, recursion, records, and state. It explains the evaluation and typing rules for records and sums, as well as the introduction of new syntactic forms and evaluation rules. The lecture also delves into the challenges of aliasing and the benefits it brings, along with examples illustrating the order of operations and the use of reference cells. Additionally, it discusses the importance of aliasing in programming languages and the implications it has on reasoning about programs and compiler optimizations.

Instructors (2)

Sébastien Jean Robert Doeraene

Martin Odersky

Martin Odersky heads the programming research group at EPFL. His research interests cover fundamental as well as applied aspects of programming languages. They include semantics, type systems, programming language design, and compiler construction. The main focus if his work lies in the integration of object-oriented and functional programming. His research thesis is that the two paradigms are just two sides of the same coin and should be unified as much as possible. To prove this he has experimented a number of language designs, from Pizza to GJ to Functional Nets. He has also influenced the development of Java as a co-designer of Java generics and as the original author of the current javac reference compiler. His current work concentrates on the Scala programming language, which unifies FP and OOP, while staying completely interoperable with Java and .NET. Martin Odersky got his doctorate from ETHZ, in 1989. He held research positions at the IBM T.J. Watson Research Center from 1989 and at Yale University from 1991. He was then a professor at the University of Karlsruhe from 1993 and at the University of South Australia from 1997. He joined EPFL as full professor in 1999. He is associate editor of the Journal of Functional Programming and member of IFIP WG 2.8. He was conference chair for ICFP 2000, and program chair for ECOOP 2004 as well as ETAPS/CC 2007.

Official source

Ontological neighbourhood

Theoretical computer science

Programming language theory: High-level programming languages

Economics

Microeconomics: Financial economics

Related concepts (32)

Type system

In computer programming, a type system is a logical system comprising a set of rules that assigns a property called a type (for example, integer, floating point, string) to every "term" (a word, phrase, or other set of symbols). Usually the terms are various constructs of a computer program, such as variables, expressions, functions, or modules. A type system dictates the operations that can be performed on a term. For variables, the type system determines the allowed values of that term.

Strong and weak typing

In computer programming, one of the many ways that programming languages are colloquially classified is whether the language's type system makes it strongly typed or weakly typed (loosely typed). However, there is no precise technical definition of what the terms mean and different authors disagree about the implied meaning of the terms and the relative rankings of the "strength" of the type systems of mainstream programming languages.

Option style

In finance, the style or family of an option is the class into which the option falls, usually defined by the dates on which the option may be exercised. The vast majority of options are either European or American (style) options. These options—as well as others where the payoff is calculated similarly—are referred to as "vanilla options". Options where the payoff is calculated differently are categorized as "exotic options". Exotic options can pose challenging problems in valuation and hedging.

Binary option

A binary option is a financial exotic option in which the payoff is either some fixed monetary amount or nothing at all. The two main types of binary options are the cash-or-nothing binary option and the asset-or-nothing binary option. The former pays some fixed amount of cash if the option expires in-the-money while the latter pays the value of the underlying security. They are also called all-or-nothing options, digital options (more common in forex/interest rate markets), and fixed return options (FROs) (on the NYSE American).

Real options valuation

Real options valuation, also often termed real options analysis, (ROV or ROA) applies option valuation techniques to capital budgeting decisions. A real option itself, is the right—but not the obligation—to undertake certain business initiatives, such as deferring, abandoning, expanding, staging, or contracting a capital investment project. For example, real options valuation could examine the opportunity to invest in the expansion of a firm's factory and the alternative option to sell the factory.

Related lectures (42)

Termination Analysis using Dependency Pairs

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

Taming Null References

Explores the challenges of null references in programming languages and proposes solutions to mitigate their drawbacks while ensuring compatibility with existing codebases.

Degree of Freedom Analysis

Explores degree of freedom analysis, redundancy, and data reconciliation in process modeling and optimization.

Meta-metaprogramming: Advanced Tools for Software Engineering

Explores 'meta-metaprogramming' for simplifying advanced programming tools and addressing software engineering challenges.

Solving Type Constraints