• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Programming languages and systems >A Semantics for Context-Sensitive Reduction Semantics
【24h】

A Semantics for Context-Sensitive Reduction Semantics

机译：上下文相关还原语义的语义

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

This paper explores the semantics of the meta-notation used in the style of operational semantics introduced by Felleisen and Hieb. Specifically, it defines a formal system that gives precise meanings to the notions of contexts, decomposition, and plugging (recomposition) left implicit in most expositions. This semantics is not naturally algorithmic, so the paper also provides an algorithm and proves a correspondence with the declarative definition. The motivation for this investigation is PUT Redex, a domain-specific programming language designed to support Felleisen-Hieb-style semantics. This style of semantics is the de-facto standard in operational semantics and, as such, is widely used. Accordingly, our goal is that Redex programs should, as much as possible, look and behave like those semantics. Since Redex's first public release more than seven years ago, its precise interpretation of contexts has changed several times, as we repeatedly encountered reduction systems that did not behave according to their authors' intent. This paper describes the culimation of that experience. To the best of our knowledge, the semantics given here accommodates even the most complex uses of contexts available.
机译：本文探讨了Felleisen和Hieb所介绍的以操作语义样式使用的元符号的语义。具体来说，它定义了一种形式化的系统，可以为大多数论述中隐含的上下文，分解和插入（重构）的概念赋予精确的含义。这种语义不是自然的算法，因此本文还提供了一种算法，并证明了与声明性定义的一致性。进行这项研究的动机是PUT Redex，这是一种特定于域的编程语言，旨在支持Felleisen-Hieb风格的语义。这种语义样式是操作语义上的事实上的标准，因此被广泛使用。因此，我们的目标是Redex程序应尽可能看起来和表现得像那些语义一样。自Redex于7年前首次公开发布以来，其对上下文的精确解释已发生了多次更改，因为我们屡次遇到不符合其作者意图的简化系统。本文描述了这种经历的顶峰。据我们所知，此处给出的语义甚至可以容纳可用的最复杂的上下文。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号