【24h】

Generative Type Abstraction and Type-level Computation

机译:生成类型抽象和类型级计算

获取原文

摘要

Modular languages support generative type abstraction, ensuring that an abstract type is distinct from its representation, except inside the implementation where the two are synonymous. We show that this well-established feature is in tension with the non-parametric features of newer type systems, such as indexed type families and GADTs. In this paper we solve the problem by using kinds to distinguish between parametric and non-parametric contexts. The result is directly applicable to Haskell, which is rapidly developing support for type-level computation, but the same issues should arise whenever generativity and non-parametric features are combined.
机译:模块化语言支持生成类型的抽象,确保抽象类型与其表示不同,除了实施中的两个是同义的。我们表明,这一成熟的功能与较新型系统的非参数特征,如索引类型的系列和加速器。在本文中,我们通过使用种类来区分参数和非参数上下文来解决问题。结果直接适用于Haskell,它正在快速开发对类型级计算的支持,但当合并和非参数功能时,应出现相同的问题。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号