首页> 外文会议>Concurrency theory >From rewrite to bisimulation congruences
【24h】

From rewrite to bisimulation congruences

机译:从重写到双仿真全等

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

摘要

The dynamics of many calculi can be msot clearly defined by a reduction semantics.To work with a calculus,however,an understanding of operational congruences is fundamental; these cna often be given tractable defintions or characteisations using a labelled transition semantics.This paper ocnsidrs calculi with arbitrary reduction semantics of three simple classes,firstly ground term rewriting,then left-linear term rewriting,and then a class which is ess4entially the action calculi lacking substantive name binding.
机译:可以通过归约语义清楚地定义许多演算的动力学。但是,要使用演算,对操作一致的理解是基本的。通常使用标记的过渡语义对这些cna进行易于处理的定义或特征化。缺乏实质性的名称约束。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号