找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Rewriting Techniques and Applications; 12th International C Aart Middeldorp Conference proceedings 2001 Springer-Verlag Berlin Heidelberg 2

[复制链接]
楼主: Polk
发表于 2025-3-27 00:42:30 | 显示全部楼层
Dependency Pairs for Equational Rewritingrary non-collapsing equations (satisfying a certain linearity condition). With the proposed approach, it is now possible to perform automated termination proofs for many systems where this was not possible before. In other words, the power of dependency pairs can now also be used for rewriting modulo equations.
发表于 2025-3-27 01:28:51 | 显示全部楼层
Termination Proofs by Context-Dependent Interpretationsofs by interpretations that can avoid this drawback of the traditional approach. A number of simple examples illustrate how to achieve tight or even optimal bounds on the derivation height. The method is general enough to capture cases where simplification orderings fail.
发表于 2025-3-27 07:50:10 | 显示全部楼层
Relating Accumulative and Non-accumulative Functional Programs of functional programs, namely restricted 2-modular tree transducers, to which it can be applied. Moreover, since we get macro tree transducers as transformation result and since we also give the inverse transformation algorithm, we have a new characterization for the class of functions induced by macro tree transducers.
发表于 2025-3-27 10:57:43 | 显示全部楼层
发表于 2025-3-27 16:29:17 | 显示全部楼层
发表于 2025-3-27 20:11:37 | 显示全部楼层
发表于 2025-3-27 22:06:25 | 显示全部楼层
发表于 2025-3-28 05:52:08 | 显示全部楼层
发表于 2025-3-28 08:34:25 | 显示全部楼层
Beta Reduction Constraintsconstraints to describe beta reduction steps between partially known lambda terms. We show that beta reduction constraints can be expressed in an extension of CLLS by group parallelism. We then extend a known semi-decision procedure for CLLS to also deal with group parallelism and thus with beta-red
发表于 2025-3-28 14:25:28 | 显示全部楼层
From Higher-Order to First-Order Rewritingof higher-order rewriting systems which can be encoded by first-order rewriting modulo an empty theory (that is, ε = 0). This class includes of course the λ-calculus. Our technique does not rely on a particular substitution calculus but on a set of abstract properties to be verified by the substitut
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-10 02:52
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表