Gradual typing enables both static and dynamic typing in the same program and makes it
convenient to migrate code regions between the two typing disciplines. One goal of gradual …

We document an operational method to construct reduction-free normalization functions.
Starting from a reduction-based normalization function from a reduction semantics, ie, the …

We present a generic formalization of the refocusing transformation for functional languages
in the Coq proof assistant. The refocusing technique, due to Danvy and Nielsen, allows for …

We present a systematic construction of a reduction-free normalization function. Starting
from a reduction-based normalization function, ie, the transitive closure of a one-step …

Abstracting abstract machines is a systematic methodology for constructing sound static
analyses for higher-order languages, by deriving small-step abstract abstract machines …

Ces dernières années ont vu l'émergence d'assistants interactifs de preuves riches en
fonctionnalités et d'une grande maturité d'implémentation, ce qui a permis l'essor des …

We derive two big-step abstract machines, a natural semantics, and the valuation function of
a denotational semantics based on the small-step abstract machine for Core Scheme …

We describe an alternative approach to handling mutable references (aka. pointers) within a
gradually typed language that has different efficiency characteristics than the prior approach …

Integrating static and dynamic typing into a single programming language enables
programmers to choose which discipline to use in each code region. Different approaches …

We inter-derive two prototypical styles of graph reduction: reduction machinesa la Turner
and graph rewriting systemsa la Barendregt et al. To this end, we adapt Danvy et al.'s …