We present gradual type theory, a logic and type theory for call-by-name gradual typing. We define the central constructions of gradual typing (the dynamic type, type casts and type error) in a novel way, by universal properties relative to new judgments for gradual type and term dynamism, which were developed in blame calculi and to state the “gradual guarantee” theorem of gradual typing. Comb...

Software-based memory protection (MP) provides not only spatial isolation of different applications, but also additional means to detect programming errors within an application. However, this luxury comes at the cost of extra runtime checks that add overhead to the application. In this paper, we present the idea of gradual software-based MP, where we only add a subset of runtime checks to a pr...

Gradual patterns highlight covariations of attributes of the form “The more/less X, the more/less Y”. Their usefulness in several applications has recently stimulated the synthesis of several algorithms for their automated discovery from large datasets. However, existing techniques require all the interesting data to be in a single database relation or table. This paper extends the notion of gr...

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 others, communication across type boundaries can be extremely expensive; still others only limited forms of interoperability. The research community is actively seeking a sound, fast, expressive approach gradual typing. I...

Usually considered as a classification problem, entity resolution (ER) can be very challenging on real data due to the prevalence of dirty values. The state-of-the-art solutions for ER were built variety learning models (most notably deep neural networks), which require lots accurately labeled training data. Unfortunately, high-quality usually expensive manual work, and are therefore not readil...