Wolfram Kahl. Relational Treatment of Term Graphs With Bound Variables. Journal of the IGPL 6 (2), 259--303 (March 1998). Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Total-Single-Pushout Derivations for Internal Graph Attribution - Kahl (1998) (Correct)
....to the l expression #x .#f .f x , where variable bindings are drawn with thick, red resp. dark grey, usually curved arrows these can in the current setting be considered as edges with just a special kind of edge labels; for more information about this kind of second order term graphs see [7,9]. We still have to show consistency of the above definition: Theorem 3.1: The category of internally attributed graphs defined in Def. 3.3 is well defined. Proof: For two homomorphisms F 1 from (G 1 , A 1 ) to (G 2 , A 2 ) and F 2 from (G 2 , A 2 ) to (G 3 , A 3 ) and for ....
Wolfram Kahl. Relational Treatment of Term Graphs With Bound Variables. Journal of the IGPL 6 (2), 259--303 (March 1998).
Internally Typed Second-Order Term Graphs - Kahl (1998) (2 citations) Self-citation (Kahl) (Correct)
....a node y : A is reachable from another node x : A if and only if (x, y) R . The relation R is acyclic if R I. A node r is a source if r ran.R, and r is a root if it is the only source (at least in the DAG setting) 3 Term Graph Definition In comparison with the untyped graphs of [3,5], we present a simplified formalisation; for the sake of brevity we do not fully formalise obvious concepts. However, we immediately present a definition for typed term graphs. For this purpose, we first formalise our view of typing without reference to any concrete typing system, just regarding ....
....the arity function A : L IN, and a partition of L into the sets C of labels for constant constructors, B for bindable variables, and M for metavariables. In the following we assume a fixed term graph alphabet (L, A, C, B, M) The main differencesbetween the following definition and those of [3,5] besides the introduction of typing are that we here only consider finite acyclic graphs and that the set of edge labels is fixed as the set of natural numbers. Definition 3.2. A term graph is a tuple G = N , L, S, D, B, W , T ) with N , the finite node set, L : N L, the node ....
[Article contains additional citation context not shown here]
Wolfram Kahl. Relational Treatment of Term Graphs With Bound Variables. Journal of the IGPL 6 (2), 259--303 (March 1998).
The Higher-Order Programming System User Manual for HOPS Version.. - Kahl (1998) (2 citations) Self-citation (Kahl) (Correct)
....reachable from another node x : A if and only if (x, y) # # R . The relation R is acyclic if R # I. A node r is a source if r # ran.R, and r is a root if it is the only source (at least in the DAG setting) 13.3. Term Graph Definition 59 13.3. Term Graph Definition In comparison with [13,16], we present a simplified formalisation; for the sake of brevity we do not fully formalise obvious concepts. On the other hand, we do not split the presentation here into first considering untyped term graphs and then introducing typed term graphs afterwards as in [15] but immediately present an ....
....(iv) B : IP .L, the set of labels for bindable variables, v) M : IP .L, the set of labels for metavariables, where C, B, M is a partition of L. In the following we assume a fixed term graph alphabet (L, A, C, B, M) The main differences between the following definition and those of [13,16] besides the introduction of typing are that we here only consider finite acyclic graphs and that the set of edge labels is fixed as the set of natural numbers. Definition 13.3.2: A term graph is a tuple G (N , L, S, D, B, W , T ) with (i) N , the finite node set, ii)L : N # L, the ....
[Article contains additional citation context not shown here]
Wolfram Kahl. Relational Treatment of Term Graphs With Bound Variables. Journal of the IGPL 6 (2), 259--303 (March 1998).
A Fibred Approach to Rewriting - How the Duality between Adding.. - Kahl (1997) Self-citation (Kahl) (Correct)
No context found.
Wolfram Kahl. Relational treatment of term graphs with bound variables. Journal of the IGPL, 1997. to appear.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC