arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1608.03424cs.PL
收藏

序排序方程程序模公理的部分求值

Partial Evaluation of Order-sorted Equational Programs modulo Axioms

Maria Alpuente, Angel Cuenca, Santiago Escobar, Jose Meseguer

摘要:

部分求值(PE)是一种功能强大的通用程序优化技术,有许多成功的应用.然而,它从来没有在表达性的基于规则的语言(如Maude,CafeOBJ,OBJ,ASF+SDF和ELAN)的上下文中进行过研究,这些语言支持:1)具有排序,子排序和重载的丰富类型结构; 2)等式重写模公理,如交换性,关联-交换性和关联-交换-恒等式。在这个扩展的抽象,我们说明了关键概念,显示他们如何适用于部分评估的表达规则为基础的程序在Maude。我们的部分评估方案是基于一个自动展开算法,计算长期的变体,并依赖于方程最小一般化,以确保全球终止。我们展示了使用的部分评估程序优化的几个例子,它显示出显着的速度。

英文摘要:

Partial evaluation (PE) is a powerful and general program optimization technique with many successful applications. However, it has never been investigated in the context of expressive rule-based languages like Maude, CafeOBJ, OBJ, ASF+SDF, and ELAN, which support: 1) rich type structures with sorts, subsorts and overloading; 2) equational rewriting modulo axioms such as commutativity, associativity-commutativity, and associativity-commutativity-identity. In this extended abstract, we illustrate the key concepts by showing how they apply to partial evaluation of expressive rule-based programs written in Maude. Our partial evaluation scheme is based on an automatic unfolding algorithm that computes term variants and relies on equational least general generalization for ensuring global termination. We demonstrate the use of the resulting partial evaluator for program optimization on several examples where it shows significant speed-ups.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑