AI Chat AI Image Generator AI Video Text to Speech

Towards a more perfect union type

11/05/2020

∙

by Michał J. Gajda, et al.

∙

∙

We present a principled theoretical framework for inferring and checking the union types, and show its work in practice on JSON data structures. The framework poses a union type inference as a learning problem from multiple examples. The categorical framework is generic and easily extensible.

page 1

page 2

page 3

page 4

research

∙ 11/05/2021

Programming with union, intersection, and negation types

In this essay, I present the advantages and, I dare say, the beauty of p...

0 Giuseppe Castagna, et al. ∙

research

∙ 03/02/2023

Sampling over Union of Joins

Data scientists often draw on multiple relational data sources for analy...

0 Yurong Liu, et al. ∙

research

∙ 09/23/2021

Union and Intersection of all Justifications

We present new algorithm for computing the union and intersection of all...

0 Jieying Chen, et al. ∙

research

∙ 07/16/2021

Almost linear Boolean functions on S_n are almost unions of cosets

We show that if f S_n →{0,1} is ϵ-close to linear in L_2 and 𝔼[f] ≤ 1/2 ...

0 Yuval Filmus, et al. ∙

research

∙ 11/23/2021

ptype-cat: Inferring the Type and Values of Categorical Variables

Type inference is the task of identifying the type of values in a data c...

0 Taha Ceritli, et al. ∙

research

∙ 08/16/2018

Constant Arboricity Spectral Sparsifiers

We show that every graph is spectrally similar to the union of a constan...

0 Timothy Chu, et al. ∙

research

∙ 11/14/2019

In Search of the Fastest Concurrent Union-Find Algorithm

Union-Find (or Disjoint-Set Union) is one of the fundamental problems in...

0 Dan Alistarh, et al. ∙