• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>3rd International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP'01), Sep 5-7, 2001, Florence, Italy >Declarative definition of group indexed data structures and approximation of their domains
【24h】

Declarative definition of group indexed data structures and approximation of their domains

机译：组索引数据结构的声明性定义及其域的近似

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

We introduce a new high-level programming abstraction which extends the concept of data collection. The new construct, called GBF (for Group Based Data-Field), is based on an algebra of index sets, called a shape, and a functional extension of the array type, the field type. Shape constructions are based on group theory and put the emphasis on the logical neighborhood of the data structure elements. A field is a function from a shape to some set of values. In this study, we focus on regular neighborhood structures and we show that arrays of any dimensions, cyclic array and trees are special kind of GBF. The recursive definitions of a GBF are then studied and we provide some elements for an implementation and some computability results in the case of recursive definition.
机译：我们引入了一种新的高级编程抽象，它扩展了数据收集的概念。名为GBF（用于基于组的数据字段）的新构造基于索引集的代数（称为形状）以及数组类型（字段类型）的功能扩展。形状构造基于组理论，并强调数据结构元素的逻辑邻域。字段是从形状到一组值的函数。在这项研究中，我们关注规则的邻域结构，并且我们发现任何维度的数组，循环数组和树都是GBF的一种特殊类型。然后研究GBF的递归定义，在递归定义的情况下，我们为实现提供了一些要素，并提供了一些可计算性结果。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号