拓扑集合上基于规则的类型化变换
Typing rule-based transformations over topological collections
摘要：
模式匹配编程是在函数式语言中开发的基于规则的编程风格的一个示例。这种编程风格在ML的方言中被广泛使用，但仅限于代数数据类型。这种限制限制了应用领域。然而，如Giavitto和Michel在RULE'02中所示，基于事例的函数定义可以扩展到称为拓扑集合的更一般的数据结构。在本文中，我们表明，这种扩展保留了类型的纪律的函数语言的好处。更确切地说，我们表明，拓扑集合和基于规则的定义与它们相关联的功能适合在一个多型扩展的迷你ML的类型推断仍然是可能的。
英文摘要：
Pattern-matching programming is an example of a rule-based programming style developed in functional languages. This programming style is intensively used in dialects of ML but is restricted to algebraic data-types. This restriction limits the field of application. However, as shown by Giavitto and Michel at RULE'02, case-based function definitions can be extended to more general data structures called topological collections. We show in this paper that this extension retains the benefits of the typed discipline of the functional languages. More precisely, we show that topological collections and the rule-based definition of functions associated with them fit in a polytypic extension of mini-ML where type inference is still possible.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
