Live programming environments aim to provide programmers (and sometimes audiences)
with continuous feedback about a program's dynamic behavior as it is being edited. The …

We define a new, more semantic interpretation of gradual types and use it to``gradualize''two
forms of polymorphism: subtyping polymorphism and implicit parametric polymorphism. In …

Many languages are beginning to integrate dynamic and static typing. Siek and Taha offered
gradual typing as an approach to this integration that provides a coherent and full-span …

C#, Dart, Pyret, Racket, TypeScript, VB: many recent languages integrate dynamic and static
types via gradual typing. We systematically develop three calculi for gradual typing and the …

Context: Gradually-typed languages allow typed and untyped code to interoperate, but
typically come with significant drawbacks. In some languages, the types are unreliable; in …

Elixir is a functional programming language with dynamic typing. In this paper we propose a
type system that makes it possible to perform static type-checking on a significant fragment …

A sound gradual type system ensures that untyped components of a program can never
break the guarantees of statically typed components. This assurance relies on runtime …

The standard algorithm for higher-order contract checking can lead to unbounded space
consumption and can destroy tail recursion, altering a program's asymptotic space …

Probabilistic programming languages have recently gained a lot of attention, in particular
due to their applications in domains such as machine learning and differential privacy. To …

In this essay I present the advantages and, I dare say, the beauty of programming in a
language with set-theoretic types, that is, types that include union, intersection, and negation …