Publications associées à ABC: Algebraic Bound Computation for Loops

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

Capturing Types

Martin Odersky, Ondrej Lhoták, 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

Tri-Axial Magnetic Field Sensor up to VHF with Frequency Weighing

German Augusto Ramirez Arroyave

This contribution presents an isotropic magnetic field probe with shaped frequency response in the band 100 kHz - 400 MHz to ponder the aggregate response according to the ICNIRP 2020 guidelines. The basic sensor is a printed loop which is modelled as a Th ...

IEEE2023

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

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

Global Free-Energy Landscapes as a Smoothly Joined Collection of Local Maps

Michele Ceriotti, Gareth Aneurin Tribello, Federico Giberti

Enhanced sampling techniques have become an essential tool in computational chemistry and physics, where they are applied to sample activated processes that occur on a time scale that is inaccessible to conventional simulations. Despite their popularity, i ...

2021

Review of control strategies for lower-limb exoskeletons to assist gait

Mohamed Bouri, Auke Ijspeert, Romain Pierre François Baud, Ali Reza Manzoori

Background Many lower-limb exoskeletons have been developed to assist gait, exhibiting a large range of control methods. The goal of this paper is to review and classify these control strategies, that determine how these devices interact with the user. Met ...

BioMed Central2021

Representing Monads with Capabilities

Martin Odersky, Aleksander Slawomir Boruch-Gruszecki, Jonathan Immanuel Brachthäuser

Programming with monads can be advantageous even in imperative languages with builtin support for side effects. However, in these languages composing monadic programs is different from composing side effecting imperative programs. This does not need to be ...

2021

Proving and Disproving Equivalence of Functional Programming Assignments

Viktor Kuncak, Dragana Milovancevic

We present an automated approach to verify the correctness of programming assignments, such as the ones that arise in a functional programming course. Our approach takes as input student submissions and reference solutions, and uses equivalence checking to ...

2023

Trust as a Programming Primitive

Adrien Ghosn

Programming has changed; programming languages have not. Modern software embraced reusable software components, i.e., public libraries, and runs in the cloud, on machines that co-locate applications from various origins. This new programming paradigm leads ...

EPFL2021

A hybrid control strategy for force and precise end effector positioning of a twisted string actuator

Jamie Paik, Andres San Millan Rodriguez

We propose a new control approach for the twisted string actuation (TSA) system; a hybrid control scheme consisting of two nested loops, considering the motor angle and the axial force at the clamping point of the actuator as the system outputs. We show th ...

2021

Unifying Analytic and Statically-Typed Quasiquotes

Christoph Koch, Amir Shaikhha, Lionel Emile Vincent Parreaux

Metaprograms are programs that manipulate (generate, analyze and evaluate) other programs. These tasks are greatly facilitated by quasiquotation, a technique to construct and deconstruct program fragments using quoted code templates expressed in the syntax ...

2018

On decoupling rate processes in chemical reaction systems - Methods and applications

Michael Amrhein, Dominique Bonvin, Julien Léo Billeter, Diogo Filipe Mateus Rodrigues

Models of chemical reaction systems can be complex as they need to include information regarding the reactions and the mass and heat transfers. The commonly used state variables, namely, concentrations and temperatures, express the interplay between many p ...

2018

Theory and Practice of Coroutines with Snapshots

Aleksandar Prokopec, Fengyun Liu

While event-driven programming is a widespread model for asynchronous computing, its inherent control flow fragmentation makes event-driven programs notoriously difficult to understand and maintain. Coroutines are a general control flow construct that can ...

2018

Higher-Order Subtyping with Type Intervals

Sandro Stucki

Modern, statically typed programming languages provide various abstraction facilities at both the term- and type-level. Common abstraction mechanisms for types include parametric polymorphism -- a hallmark of functional languages -- and subtyping -- which ...

EPFL2017

Simplicitly: Foundations and Applications of Implicit Function Types

Martin Odersky, Sandro Stucki, Olivier Eric Paul Blanvillain, Heather Christine Klug, Fengyun Liu

Understanding a program entails understanding its context; dependencies, configurations and even implementations are all forms of contexts. Modern programming languages and theorem provers offer an array of constructs to define contexts, implicitly. Scala ...

2017

Algorithmic Resource Verification

Ravichandhran Kandhadai Madhavan

Static estimation of resource utilisation of programs is a challenging and important problem with numerous applications. In this thesis, I present new algorithms that enable users to specify and verify their desired bounds on resource usage of functional p ...

EPFL2017

Verification by Reduction to Functional Programs

Régis William Blanc

In this thesis, we explore techniques for the development and verification of programs in a high-level, expressive, and safe programming language. Our programs can express problems over unbounded domains and over recursive and mutable data structures. We p ...

EPFL2017

Interactive Programming by Example

Mikaël Mayer

As of today, programming has never been so accessible. Yet, it remains a challenge for end-users: students, non-technical employees, experts in their domains outside of computer science, and so on. With its forecast potential for solving problems by only o ...

EPFL2017

Quoted Staged Rewriting: A Practical Approach to Library-Defined Optimizations

Christoph Koch, Amir Shaikhha, Lionel Emile Vincent Parreaux

Staging has proved a successful technique for programmatically removing code abstractions, thereby allowing for faster program execution while retaining a high-level interface for the programmer. Unfortunately, techniques based on staging suffer from a num ...

ACM2017