Refinement types enrich a language's type system with logical predicates that circumscribe
the set of values described by the type. These refinement predicates provide software …

There is growing interest in termination reasoning for nonlinear programs and, meanwhile,
recent dynamic strategies have shown they are able to infer invariants for such challenging …

We investigate gradual variations on the Calculus of Inductive Construction (CIC) for swifter
prototyping with imprecise types and terms. We observe, with a no-go theorem, a crucial …

Dependent types help programmers write highly reliable code. However, this reliability
comes at a cost: it can be challenging to write new prototypes in (or migrate old code to) …

Durant leurs plus de 50 ans d'existence, les assistants à la preuve se sont établis comme
des outils permettant un haut niveau de fiabilité dans de nombreuses applications …

In his famous paper entitled" Tackling the Awkward Squad", Peyton Jones studies how
features that traditionally did not fit in the functional programming paradigm can be added to …

Program equivalence checking is the task of confirming that two programs have the same
behavior on corresponding inputs. We develop a calculus based on symbolic execution and …

Sound gradual types come in many forms and offer varying levels of soundness. Two
extremes are deep types and shallow types. Deep types offer compositional guarantees but …

The design space of mixed-typed languages is lively but disorganized. On one hand,
researchers across academia and industry have contributed language designs that allow …

Context: Reactive programming (RP) is a declarative programming paradigm suitable for
expressing the handling of events. It enables programmers to create applications that react …