Towards a more perfect union type

descriptionPublicationkeyboard_double_arrow_right Preprint , Article , Other literature type 01 Jan 2020Embargo end date: 01 Jan 2020 English Publisher:ZenodoJournal:CoRR, volume abs/2011.03076

Authors: Gajda, Michał Jan;

doi: 10.5281/zenodo.3929489 , 10.48550/arxiv.2011.03076 , 10.5281/zenodo.3929474 , 10.5281/zenodo.3929473

arXiv: 2011.03076

Towards a more perfect union type

- Summary
- Subjects
- Metrics

Abstract

We present a principled theoretical framework for dealing with 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

FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Computer Science - Programming Languages, type inference, typelike, functional programming, union types, Programming Languages (cs.PL), Logic in Computer Science (cs.LO)

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	0
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average