Publications associées à Typed lambda calculus

Degrees of Separation: A Flexible Type System for Safe Concurrency

Martin Odersky, Yichen Xu, Aleksander Slawomir Boruch-Gruszecki

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

Failure and success of the spectral bias prediction for Laplace Kernel Ridge Regression: the case of low-dimensional data

Matthieu Wyart, Umberto Maria Tomasini, Antonio Sclocchi

Recently, several theories including the replica method made predictions for the generalization error of Kernel Ridge Regression. In some regimes, they predict that the method has a 'spectral bias': decomposing the true function f* on the eigenbasis of the ...

JMLR-JOURNAL MACHINE LEARNING RESEARCH2022

Measurement of the Lambda(0)(b) -> J/psi Lambda angular distribution and the Lambda(0)(b) polarisation in pp collisions

Olivier Schneider, Aurelio Bay, Yiming Li, Guido Haefeli, Frédéric Blanc, Christoph Frei, Tatsuya Nakada, Michel De Cian, Luca Pescatore, François Fleuret

This paper presents an analysis of the Lambda(0)(b) -> J/psi Lambda angular distribution and the transverse production polarisation of Lambda(0)(b) baryons in proton-proton collisions at centre-of-mass energies of 7, 8 and 13TeV. The measurements are perfo ...

Springer Nature2020

On the probability distribution of the local times of diagonally operator-self-similar Gaussian fields with stationary increments

Thomas Mountford, Kamran Kalbasi

In this paper, we study the local times of vector-valued Gaussian fields that are 'diagonally operator-selfsimilar' and whose increments are stationary. Denoting the local time of such a Gaussian field around the spatial origin and over the temporal unit h ...

INT STATISTICAL INST2020

Verified Functional Programming

Nicolas Charles Yves Voirol

In this thesis, we present Stainless, a verification system for an expressive subset of the Scala language. Our system is based on a dependently-typed language and an algorithmic type checking procedure which ensures total correctness. We rely on SMT solve ...

EPFL2019

The epsilon expansion meets semiclassics

Riccardo Rattazzi, Alexander Monin, Gil Badel, Gabriel Francisco Cuomo

We study the scaling dimension Delta(phi n) of the operator phi(n) where phi is the fundamental complex field of the U(1) model at the Wilson-Fisher fixed point in d = 4 - epsilon. Even for a perturbatively small fixed point coupling lambda*, standard pert ...

Springer Nature2019

Observation of Two Resonances in the Lambda(0)(b)pi(+/-) Systems and Precise Measurement of Sigma(+/-)(b) and Sigma(*+/-)(b) Properties

Olivier Schneider, Aurelio Bay, Guido Haefeli, Christoph Frei, Tatsuya Nakada, Frédéric Blanc, Michel De Cian, Luca Pescatore, François Fleuret, Chitsanu Khurewathanakul

The first observation of two structures consistent with resonances in the final states Lambda(0)(b)pi(-) and Lambda(0)(b)pi(+) thorn is reported using samples of pp collision data collected by the LHCb experiment at root s = 7 and 8 TeV, corresponding to a ...

2019

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

Compilation Techniques for Incremental Collection Processing

Daniel Lupei

Many map-reduce frameworks as well as NoSQL systems rely on collection programming as their interface of choice due to its rich semantics along with an easily parallelizable set of primitives. Unfortunately, the potential of collection programming is not ...

EPFL2017

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