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

Publication

Virtual ADTs for Portable Metaprogramming

Martin Odersky, Nicolas Alexander Stucki
2021
Conference Papers

Abstract

Scala 3 provides a metaprogramming interface that represents the abstract syntax tree definitions using algebraic data types. To allow the compiler to freely evolve without breaking the metaprogramming interface, we present virtual algebraic data types (or Virtual ADTs) - a programming pattern, which allows programmers to describe mutually recursive hierarchies of types without coupling to a particular runtime representation.

Official source

https://infoscience.epfl.ch/entities/publication/7323370a-0c30-4cc8-b52d-f53426f08337

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Martin Odersky, Nicolas Alexander Stucki
2021
Conference Papers

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/7323370a-0c30-4cc8-b52d-f53426f08337

About this result

Ontological neighbourhood

Theoretical computer science

Programming language theory: High-level programming languages

Related concepts (31)

Algebraic data type

In computer programming, especially functional programming and type theory, an algebraic data type (ADT) is a kind of composite type, i.e., a type formed by combining other types. Two common classes of algebraic types are product types (i.e., tuples and records) and sum types (i.e., tagged or disjoint unions, coproduct types or variant types). The values of a product type typically contain several values, called fields. All values of that type have the same combination of field types.

Data type

In computer science and computer programming, a data type (or simply type) is a collection or grouping of data values, usually specified by a set of possible values, a set of allowed operations on these values, and/or a representation of these values as machine types. A data type specification in a program constrains the possible values that an expression, such as a variable or a function call, might take. On literal data, it tells the compiler or interpreter how the programmer intends to use the data.

Generalized algebraic data type

In functional programming, a generalized algebraic data type (GADT, also first-class phantom type, guarded recursive datatype, or equality-qualified type) is a generalization of parametric algebraic data types. In a GADT, the product constructors (called data constructors in Haskell) can provide an explicit instantiation of the ADT as the type instantiation of their return value. This allows defining functions with a more advanced type behaviour.

Related publications (23)

Virtual ADTs for Portable Metaprogramming

Graph Chatbot

Degrees of Separation: A Flexible Type System for Safe Concurrency

Automated Formal Verification of Software Network Functions

When Subtyping Constraints Liberate A Novel Type Inference Approach for First-Class Polymorphism