首页> 外文会议>Algebraic informatics >Simplifying Algebraic Functional Systems
【24h】

Simplifying Algebraic Functional Systems

机译:简化代数功能系统

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

摘要

A popular formalism of higher order rewriting, especially in the light of termination research, are the Algebraic Functional Systems (AFSs) defined by Jouannaud and Okada. However, the formalism is very permissive, which makes it hard to obtain results; consequently, techniques are often restricted to a subclass. In this paper we study termination-preserving transformations to make AFS-programs adhere to a number of standard properties. This makes it significantly easier to obtain general termination results.
机译:Jouannaud和Okada定义的代数功能系统(AFS)是流行的高级重写形式,尤其是根据终止研究。但是,形式主义非常宽容,因此很难获得结果。因此,技术通常仅限于子类。在本文中,我们研究了保留终止的转换,以使AFS程序遵守许多标准属性。这使得获得一般的终止结果变得非常容易。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号