Transformation of XML Documents with Higher-Order Matching based on Higher-Order Rewrite Systems

基于高阶重写系统的高阶匹配XML文档转换

基本信息

  • 批准号:
    15500014
  • 负责人:
  • 金额:
    $ 2.3万
  • 依托单位:
  • 依托单位国家:
    日本
  • 项目类别:
    Grant-in-Aid for Scientific Research (C)
  • 财政年份:
    2003
  • 资助国家:
    日本
  • 起止时间:
    2003 至 2005
  • 项目状态:
    已结题

项目摘要

The aim of the research is to give an expressive XML transformation framework based on higher-order rewrite systems.One of our research results is that we have provided a class of higher-order rewrite systems suitable for XML transformation and have investigated type-theoretic properties. We have found that regarding contexts, i.e., terms extended with holes, as second-order terms are suitable for higher-order pattern matching of XML documents. We have also introduced a novel type system called incomplete regular expression type, which is obtained by adapting the notion of contexts to regular expression types. This type system is indispensable for a flexible typed higher-order pattern matching because holes occurring in incomplete regular expression types can be instantiated with arbitrary types in extracting patterns from XML terms and in composing XML terms from patterns. Based on the terms and the type system mentioned above, we designed a class of higher-order term rewriting system … More and illustrated its usefulness by examples of XML transformations. We have also proved that the type system enjoys static type checking of rewrite rules.Another research result is that we have designed a pattern matching algorithm of term representations of XML documents against second-order patterns and have investigated its theoretical properties. We designed the algorithm based on so-called transformation method, which is defined with a set of inference rules that transform sequences of equations that represent pattern matching problems. We have found that inference rules for second-order matching are derived from the first-order matching as their natural extension. Investigating properties of the pattern matching algorithm, we have proved its soundness and completeness.The obtained research results give theoretical foundation for the investigation of properties of XML transformation with rewriting techniques. Because Rewriting techniques are suitable for studying properties such as confluence and termination, our research results are helpful in investigating such properties of XML transformation. Less
本文的研究目标是给出一个基于高阶重写系统的XML转换框架,其中一个研究成果是给出了一类适合于XML转换的高阶重写系统,并研究了它们的类型论性质。我们已经发现,关于上下文,即,术语扩展了洞,作为二阶术语适用于XML文档的高阶模式匹配。我们还介绍了一种新的类型系统,称为不完全正则表达式类型,它是通过将上下文的概念适应于正则表达式类型而获得的。这种类型系统对于灵活的类型化高阶模式匹配是必不可少的,因为在从XML术语提取模式和从模式组成XML术语时,可以用任意类型实例化不完整正则表达式类型中出现的漏洞。基于上述项和类型系统,我们设计了一类高阶项重写系统 ...更多信息 并通过XML转换的示例说明了它的有用性。我们还证明了该类型系统具有重写规则的静态类型检查能力。另一个研究成果是,我们设计了一个针对二阶模式的XML文档术语表示的模式匹配算法,并研究了它的理论性质。我们设计的算法的基础上,所谓的转换方法,这是定义了一组推理规则,转换序列的方程,代表模式匹配问题。我们发现,二阶匹配的推理规则是从一阶匹配作为其自然扩展。研究了模式匹配算法的性质,证明了该算法的正确性和完备性,为研究基于重写技术的XML转换的性质提供了理论基础。由于重写技术适合于研究合流和终止等属性,我们的研究结果有助于研究XML转换的这些属性。少

项目成果

期刊论文数量(23)
专著数量(0)
科研奖励数量(0)
会议论文数量(0)
专利数量(0)
抽象高階書換え系におけるナローイング
抽象高阶重写系统的缩小
A statically typed second-order rewrite system for XML transformation.
用于 XML 转换的静态类型二阶重写系统。
Narrowing in Abstract Higher-Order Rewrite Systems.(in Japanese)
抽象高阶重写系统的缩小。(日语)
Pattern Matching of Incompletely RE-Typed Expressions via Transformation.
通过转换对不完全重新键入的表达式进行模式匹配。
奥居哲, 鈴木太朗: "抽象高階書換え系におけるナローイング"情報処理学会論文誌:プログラミング. 44(SIG16). 56-67 (2003)
Satoshi Okui、Taro Suzuki:“抽象高阶重写系统的缩小”日本信息处理协会汇刊:编程 44 (SIG16) (2003)。
  • DOI:
  • 发表时间:
  • 期刊:
  • 影响因子:
    0
  • 作者:
  • 通讯作者:
{{ item.title }}
{{ item.translation_title }}
  • DOI:
    {{ item.doi }}
  • 发表时间:
    {{ item.publish_year }}
  • 期刊:
  • 影响因子:
    {{ item.factor }}
  • 作者:
    {{ item.authors }}
  • 通讯作者:
    {{ item.author }}

数据更新时间:{{ journalArticles.updateTime }}

{{ item.title }}
  • 作者:
    {{ item.author }}

数据更新时间:{{ monograph.updateTime }}

{{ item.title }}
  • 作者:
    {{ item.author }}

数据更新时间:{{ sciAawards.updateTime }}

{{ item.title }}
  • 作者:
    {{ item.author }}

数据更新时间:{{ conferencePapers.updateTime }}

{{ item.title }}
  • 作者:
    {{ item.author }}

数据更新时间:{{ patent.updateTime }}

SUZUKI Taro其他文献

SUZUKI Taro的其他文献

{{ item.title }}
{{ item.translation_title }}
  • DOI:
    {{ item.doi }}
  • 发表时间:
    {{ item.publish_year }}
  • 期刊:
  • 影响因子:
    {{ item.factor }}
  • 作者:
    {{ item.authors }}
  • 通讯作者:
    {{ item.author }}

{{ truncateString('SUZUKI Taro', 18)}}的其他基金

Formalization of Process Calculi Using An Abstract Higher-Order Rewrite System
使用抽象高阶重写系统的过程计算的形式化
  • 批准号:
    13680388
  • 财政年份:
    2001
  • 资助金额:
    $ 2.3万
  • 项目类别:
    Grant-in-Aid for Scientific Research (C)

相似海外基金

Formalization of Process Calculi Using An Abstract Higher-Order Rewrite System
使用抽象高阶重写系统的过程计算的形式化
  • 批准号:
    13680388
  • 财政年份:
    2001
  • 资助金额:
    $ 2.3万
  • 项目类别:
    Grant-in-Aid for Scientific Research (C)
{{ showInfoDetail.title }}

作者:{{ showInfoDetail.author }}

知道了