Publications related to Spores: A Type-Based Foundation for Closures in the Age of Concurrency and Distribution

Related publications (22)

Degrees of Separation: A Flexible Type System for Safe Concurrency

Martin Odersky, Aleksander Slawomir Boruch-Gruszecki, Yichen Xu

Data races have long been a notorious problem in concurrent programming. They are subtle to detect, and lead to non-deterministic behaviours. There has been a lot of interest in type systems that statically guarantee data race freedom. Significant progress ...

2024

Formal Foundations of Capture Tracking

Aleksander Slawomir Boruch-Gruszecki

Type systems are a device for verifying properties of programs without running them. Many programming languages used in the industry have always had a type system, while others were initially created without a type system and later adopted one, when the ad ...

EPFL2024

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

Lionel Emile Vincent Parreaux, Aleksander Slawomir Boruch-Gruszecki

Type inference in the presence of first-class or "impredicative" second-order polymorphism a la System F has been an active research area for several decades, with original works dating back to the end of the 80s. Yet, until now many basic problems remain ...

Assoc Computing Machinery2024

Multimodal transcriptomic atlases of mouse spinal cord injury

Matthieu Pierre Gautier

A spinal cord injury (SCI) triggers a cascade of molecular and cellular responses involving inflammatory cell infiltration and cytokine release, apoptosis, demyelination, excitotoxicity, ischemia, and the formation of a fibrotic scar surrounded by an astro ...

EPFL2024

Automated Formal Verification of Software Network Functions

Solal Vincenzo Pirelli

Formally verifying the correctness of software is necessary to merit the trust people put in software systems. Currently, formal verification requires human effort to prove that a piece of code matches its specification and code changes to improve verifiab ...

EPFL2024

Capturing Types

Martin Odersky, Aleksander Slawomir Boruch-Gruszecki

Type systems usually characterize the shape of values but not their free variables. However, many desirable safety properties could be guaranteed if one knew the free variables captured by values. We describe CC

Assoc Computing Machinery2023

Between the Pattern and the Type: A short parallel story

Vasileios Chanis

Historically speaking, the notion of the type was reintroduced to the larger architectural discourse as a direct consequence of the crisis of the Modern. The task of revisiting the forms of the past also dictated the return of architectural methods that ha ...

2023

Type-Preserving Compilation of Class-Based Languages

Guillaume André Fradji Martres

The Dependent Object Type (DOT) calculus was designed to put Scala on a sound basis, but while DOT relies on structural subtyping, Scala is a fundamentally class-based language. This impedance mismatch means that a proof of DOT soundness by itself is ...

EPFL2023

Regulation and function of a hemicleaved Activin-A processing intermediate in melanoma

Manon Bulliard

Activin-A is a Transforming Growth Factor-B (TGFB)-related cytokine that regulates various biological processes including cell proliferation and differentiation through autocrine, paracrine or endocrine signaling. Activin-A expression is upregulated in mul ...

EPFL2023

The role of secondary ice production in mixed-phase clouds

Paraskevi Georgakaki

Clouds are omnipresent in the Earth's atmosphere. Their phase composition significantly modulates their interaction with solar and terrestrial radiation, as well as precipitation formation. Particularly for clouds containing both phases, known as mixed-pha ...

EPFL2023

On algebraic array theories

Viktor Kuncak, Rodrigo Raya

Automatic verification of programs manipulating arrays relies on specialised decision procedures. A methodology to classify the theories handled by these procedures is introduced. It is based on decomposition theorems in the style of Feferman and Vaught. T ...

Elsevier Science Inc2023

Analysing the potential for modal shiftbased on the logic of modal choice

Vincent Kaufmann, Ludy Juliana González Villamizar, Eloi Antoine Maël Bernier, Florian Lucien Jacques Masse

This article explores how the logic underlying modal practices tends to modulate the population’s responsiveness to improvements in global transport supply. Based on a quantitative survey conducted in 2018–2019 among the working population of the cantons o ...

2023

Scaling Language Features for Program Verification

Georg Stefan Schmid

Formal verification of real-world software systems remains challenging for a number of reasons, including lack of automation, friction in specifying properties, and limited support for the diverse programming paradigms used in industry. In this thesis we m ...

EPFL2022

Type-Level Programming with Match Types

Martin Odersky, Olivier Eric Paul Blanvillain

Type-level programming is becoming more and more popular in the realm of functional programming. However, the combination of type-level programming and subtyping remains largely unexplored in practical programming languages. This paper presents match types ...

ASSOC COMPUTING MACHINERY2022

Abstractions for Type-Level Programming

Olivier Eric Paul Blanvillain

Over the past decade, the Scala community has shown great interest in using type-level programming to obtain additional type safety. Unfortunately, the lack of support from the Scala compiler has been a barrier to the adoption of that technique, notably du ...

EPFL2022

Studies on Types: Dormitories

Tiago André Pratas Borges, Anja Fröhlich, Estelle Lépine, Vanessa Pointet

Concepts of type and typology are not specific to architecture. Rather they represent an interdisciplinary approach to ordering knowledge and gaining insight. In the field of architecture, the study of types and typology offers a didactic perspective that ...

EPFL Press2022

A case for DOT: Theoretical Foundations for Objects with Pattern Matching and GADT-Style Reasoning

Lionel Emile Vincent Parreaux, Aleksander Slawomir Boruch-Gruszecki, Yichen Xu

Many programming languages in the OO tradition now support pattern matching in some form. Historical examples include Scala and Ceylon, with the more recent additions of Java, Kotlin, TypeScript, and Flow. But pattern matching on generic class hierarchies ...

Assoc Computing Machinery2022

An Exploratory Study of Reactions to Bot Comments on GitHub

Denis Gillet, Juan Carlos Farah, Sandy Ingram

The widespread use of bots to support software development makes social coding platforms such as GitHub a particularly rich source of data for the study of human-bot interaction. Software development bots are used to automate repetitive tasks, interacting ...

ACM2022

The concept of axial weak twins

Cyril Cayron

It is generally assumed that the parent-twin interface is a fully invariant plane. The calculations of the rational interfaces of the type I twins and irrational interfaces of the type II twins are based on this hypothesis. Recently, some asymmetric facets ...

PERGAMON-ELSEVIER SCIENCE LTD2022

Virtual ADTs for Portable Metaprogramming

Martin Odersky, Nicolas Alexander Stucki

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 ...

ASSOC COMPUTING MACHINERY2021