System $F^ω$ 与相干隐式解析
System $F^ω$ with Coherent Implicit Resolution
AI总结:
本文提出一种扩展 System $F^ω$ 的隐式编程演算,支持高阶类型实例,并给出无歧义、相干的解析的声明式规范。
摘要:
我们提出了一种用于建模隐式编程的演算,该演算支持具有高阶类型的一等、重叠、局部作用域和高阶实例。我们提出了对成熟的 System $F^ω$ 的一个直接推广,以支持隐式参数,并对类型抽象和项抽象进行统一处理。与以往工作不同,我们给出了无歧义且因此相干的解析的声明式规范,而无需引入由解析的算法公式化所驱动的限制。
英文摘要:
We propose a calculus for modeling implicit programming that supports first-class, overlapping, locally scoped, and higher-order instances with higher-kinded types. We propose a straightforward generalization of the well-established System $F^ω$ to implicit parameters, with a uniform treatment of type and term abstractions. Unlike previous works, we give a declarative specification of unambiguous, and thus coherent, resolution without introducing restrictions motivated by an algorithmic formulation of resolution.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。