Addressed Term Rewriting Systems: Syntax, Semantics, and Pragmatics Extended Abstract

被引：4
|
作者：
Dougherty, Dan [1 ]
Lescanne, Pierre [2 ]
Liquori, Luigi [3 ]
Lang, Frederic [4 ]
机构：
[1] Worcester Polytech Inst, Worcester, MA 01609 USA
[2] Ecole Normale Super, Lyon, France
[3] INRIA Sophia Antipolis, Valbonne, France
[4] INRIA Rhone Alpes, Villeurbanne, France
来源：
ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE | 2005年 / 127卷 / 05期
关键词：
Term Rewriting System; Graph Rewriting; Lambda Calculi; Object Calculi;
D O I：
10.1016/j.entcs.2004.12.042
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We present a formalism called Addressed Term Rewriting Systems, which can be used to define the operational semantics of programming languages, especially those involving sharing, recursive computations and cyclic data structures. Addressed Term Rewriting Systems are therefore well suited for describing object-based languages, as for instance the family of languages called lambda Obj(a), involving both functional and object-based features.
引用
收藏
页码：57 / 82
页数：26
相关论文
共 50 条
12345