Lecture

Model Interpretation and Compilation

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Description

This lecture covers the concept of model interpretation and compilation through partial evaluation, focusing on the transformation of interpreters into compiled code. The instructor discusses the process of partial evaluation using examples like the power function, automatic partial evaluation, and Futamura Projections. The lecture explores the challenges and benefits of partial evaluation, the role of model interpreters in model languages, and the development of a partial evaluator for Java. It also delves into the transition from full evaluation to partial evaluation, online partial evaluation techniques, and concerns related to Java partial evaluation. The discussion includes the comparison between offline and online partial evaluation, function calls, supercompilation, and concludes with the importance of model interpreters in supporting various modeling languages and dynamic execution.

Official source

Ontological neighbourhood

Theoretical computer science

Programming language theory: High-level programming languages

Related concepts (32)

Meta-circular evaluator

In computing, a meta-circular evaluator (MCE) or meta-circular interpreter (MCI) is an interpreter which defines each feature of the interpreted language using a similar facility of the interpreter's host language. For example, interpreting a lambda application may be implemented using function application. Meta-circular evaluation is most prominent in the context of Lisp. A self-interpreter is a meta-circular interpreter where the interpreted language is nearly identical to the host language; the two terms are often used synonymously.

Compiler

In computing, a compiler is a computer program that translates computer code written in one programming language (the source language) into another language (the target language). The name "compiler" is primarily used for programs that translate source code from a high-level programming language to a low-level programming language (e.g. assembly language, object code, or machine code) to create an executable program. There are many different types of compilers which produce output in different useful forms.

Republic of Texas

The Republic of Texas (República de Tejas) was a sovereign state in North America that existed from March 2, 1836, to February 19, 1846, that bordered Mexico, the Republic of the Rio Grande in 1840 (another breakaway republic from Mexico), and the United States of America, although Mexico considered it a rebellious province during its entire existence despite the Treaties of Velasco of May 1836. It was bordered by Mexico to the west and southwest, the Gulf of Mexico to the southeast, the two U.S.

Partial evaluation

In computing, partial evaluation is a technique for several different types of program optimization by specialization. The most straightforward application is to produce new programs that run faster than the originals while being guaranteed to behave in the same way. A computer program prog is seen as a mapping of input data into output data: where , the static data, is the part of the input data known at compile time. The partial evaluator transforms into by precomputing all static input at compile time.

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.

Related lectures (64)

Code Generation Lab

Covers generating code for a compiler, translating an Amy program to WebAssembly, including memory management and pattern matching compilation.

Correctness of Compilers: Part 2

Explores the correctness of compilers, emphasizing expression evaluation, bytecode compilation, and stack operations.

Compiler Extension Lab

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

Verifying Compiler: Spec# Approach

Explores the Spec# programming system, focusing on a verifying compiler for C# 2.0.

Compilation and C++ Basics