【24h】

Constraint-set Satisfiability for Overloading

机译:过载的约束集可满足性

获取原文
获取原文并翻译 | 示例

摘要

This article discusses the problem of constraint-set satisfiability (CS-SAT) — that is, the problem of determining whether a given constraint-set is satisfiable in a given typing context — in the context of systems with support for overloading and parametric polymorphism. The paper reviews previous works on constraint-set satisfiability, showing that overloading policies used in order to guarantee decidability of CS-SAT have been generally too restrictive. An algorithm is proposed that does not impose a severe restriction on possible overloadings and decides CS-SAT in an expect-edly vast majority of cases of practical interest. In cases for which satisfiability cannot be decided, a configurable limit on the number of iterations is used in order to guarantee termination.
机译:本文讨论了在支持重载和参数多态性的系统中,约束集可满足性(CS-SAT)的问题,即确定给定类型上下文中给定约束集是否可满足的问题。该论文回顾了有关约束集可满足性的先前工作,表明为了保证CS-SAT的可决策性而使用的重载策略通常过于严格。提出了一种算法,该算法不对可能的过载施加严格的限制,并在预期的绝大多数实用情况下决定CS-SAT。在无法确定可满足性的情况下,对迭代次数使用可配置的限制,以保证终止。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号