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

Lecture

Course Introduction: Compilation of High-Level Languages

In course

CS-420: Advanced compiler construction

Students learn several implementation techniques for modern functional and object-oriented programming languages. They put some of them into practice by developing key parts of a compiler and run time system for a simple functional programming language. ...

Description

This lecture introduces the course on compiling high-level functional and object-oriented languages, focusing on concepts like closures, intermediate languages, optimizations, virtual machines, and garbage collection. The instructor emphasizes the importance of prerequisite skills in functional programming and low-level programming. The evaluation includes group projects and an oral exam. The lecture covers the complexity of real compilers, including simplification and optimization phases. It also discusses memory management, virtual machines, and dynamic compilation. The course aims to teach students how to handle high-level language concepts, optimize code, and build sophisticated run time systems.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Instructor

Michel Schinz

Official source

Ontological neighbourhood

Theoretical computer science

Programming language theory: High-level programming languages

Related concepts (32)

Convex optimization

Convex optimization is a subfield of mathematical optimization that studies the problem of minimizing convex functions over convex sets (or, equivalently, maximizing concave functions over convex sets). Many classes of convex optimization problems admit polynomial-time algorithms, whereas mathematical optimization is in general NP-hard.

Optimizing compiler

In computing, an optimizing compiler is a compiler that tries to minimize or maximize some attributes of an executable computer program. Common requirements are to minimize a program's execution time, memory footprint, storage size, and power consumption (the last three being popular for portable computers). Compiler optimization is generally implemented using a sequence of optimizing transformations, algorithms which take a program and transform it to produce a semantically equivalent output program that uses fewer resources or executes faster.

Object-oriented programming

Object-Oriented Programming (OOP) is a programming paradigm based on the concept of "objects", which can contain data and code. The data is in the form of fields (often known as attributes or properties), and the code is in the form of procedures (often known as methods). A common feature of objects is that procedures (or methods) are attached to them and can access and modify the object's data fields. In this brand of OOP, there is usually a special name such as or used to refer to the current object.

Memory management

Memory management is a form of resource management applied to computer memory. The essential requirement of memory management is to provide ways to dynamically allocate portions of memory to programs at their request, and free it for reuse when no longer needed. This is critical to any advanced computer system where more than a single process might be underway at any time. Several methods have been devised that increase the effectiveness of memory management.

Garbage collection (computer science)

In computer science, garbage collection (GC) is a form of automatic memory management. The garbage collector attempts to reclaim memory which was allocated by the program, but is no longer referenced; such memory is called garbage. Garbage collection was invented by American computer scientist John McCarthy around 1959 to simplify manual memory management in Lisp. Garbage collection relieves the programmer from doing manual memory management, where the programmer specifies what objects to de-allocate and return to the memory system and when to do so.

Related lectures (39)

Covers the efficiency of register machines over stack machines, memory organization, and mapping instructions.

Dynamic Memory Management and Dynamic Dispatch

Explores memory management, safety, automated techniques, garbage collection, dynamic dispatch, and first-class functions.

Virtual Machines: Memory Management and Control Flow

Covers the architecture of virtual machines, focusing on memory management, control flow, and the CEK machine's semantics.

Advanced Spark: Partitioning and Optimization

Explores advanced Spark topics like partitioning strategies, memory optimization, and shuffle operations for efficient job execution.

Computer Architecture: Algorithms to Programs (Compilation)