Towards a more perfect union type
Programming Languages
2021-01-13 v2 Logic in Computer Science
Abstract
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.
Keywords
Cite
@article{arxiv.2011.03076,
title = {Towards a more perfect union type},
author = {Michał J. Gajda},
journal= {arXiv preprint arXiv:2011.03076},
year = {2021}
}