Skip to search formSkip to main contentSkip to account menu

Abstract semantic graph

Known as: ASG, Term graph 
In computer science, an abstract semantic graph (ASG) or term graph is a form of abstract syntax in which an expression of a formal or programming… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Recently, Retrospective Event Detection attracts much attention. Most researches focus on detecting coarse-grained events or… 
2014
2014
  • P. Bahr
  • 2014
  • Corpus ID: 4503874
We study an alternative model of infinitary term rewriting. Instead of a metric on terms, a partial order on partial terms is… 
2010
2010
We in vestigate an alternative model of infinitary term rewriting. Instead of a metric, a partial order on terms is employed to… 
2006
2006
This paper will present improvements on the term graph rewriting model of implementation for the (untyped) calculus X as… 
2005
2005
  • H. Schneider
  • 2005
  • Corpus ID: 11576917
In the double-pushout approach to graph transformations, most authors assume the left-hand side to be injective, since the… 
1997
1997
Two superficially similar graph rewriting formalisms, Interaction Nets and MONSTR, are studied. Interaction Nets come from… 
1995
1995
Two of the currently most promising programming paradigms, namely object-oriented programming and concurrent constraint… 
1995
1995
Innnite terms in universal algebras are a well-known topic since the seminal work of the ADJ group 1]. The recent interest in the… 
1992
1992
Graph rewrite systems play an important role in the implementation of functional programming languages. This paper focusses on…