当前位置: X-MOL 学术arXiv.cs.LO › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Towards a more perfect union type
arXiv - CS - Logic in Computer Science Pub Date : 2020-11-05 , DOI: arxiv-2011.03076
Micha{\l} J. Gajda

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.

中文翻译:

走向更完美的工会类型

我们提出了一个用于推断和检查联合类型的原则性理论框架,并展示了它在 JSON 数据结构上的实践工作。该框架将联合类型推理作为从多个示例中的学习问题提出。分类框架是通用的且易于扩展。
更新日期:2020-11-11
down
wechat
bug