arXiv subjects

Yann Hamdaoui

Publications and source records attributed to Yann Hamdaoui.

3 recordsLinked to original sources

arXiv2022

Union and intersection contracts are hard, actually

Union and intersection types are a staple of gradually typed language such as TypeScript. While it's long been recognized that union and intersection types are difficult to verify statically, it may appear at first that the dynamic part of gradual typing is actually pretty simple. It turns out however, that in presence of higher-order contracts union and intersection are deceptively difficult. The literature on higher-order contracts with union and intersection, while keenly aware of the fact, doesn't really explain why. We point and illustrate the problems and trade-offs inherent to union and intersection contracts, via example and a survey of the literature.

cs.PL↗

arXiv2021

Interpreting a concurrent $λ$-calculus in differential proof nets (extended version)

In this paper, we show how to interpret a language featuring concurrency, references and replication into proof nets, which correspond to a fragment of differential linear logic. We prove a simulation and adequacy theorem. A key element in our translation are routing areas, a family of nets used to implement communication primitives which we define and study in detail.

cs.LO↗

arXiv2021

An Interactive Proof of Termination for a Concurrent $λ$-calculus with References and Explicit Substitutions

In this paper we introduce a typed, concurrent $λ$-calculus with references featuring explicit substitutions for variables and references. Alongside usual safety properties, we recover strong normalization. The proof is based on a reducibility technique and an original interactive property reminiscent of the Game Semantics approach.

cs.LO↗