Wolfram Kahl  Home/Search
Context Related
| oup.co.uk/igpl/Volume_06/I...Kahl.ps.gz oup.co.uk/igpl/Volume_06/Iss...Kahl.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: oup.co.uk/igpl/Volume_06/Issue... (more) From: oup.co.uk/igpl/Volume_06/Issue... (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We show how and why it makes sense to use a relational formalisation instead of the usual functional one in the treatment of term graphs. Special attention is paid to term graphs with bound variables, that have, to our knowledge, never been formalised with such a generality before. Besides the novel treatment of term graphs themselves, we present an innovative relational homomorphism concept that for the first time allows to consider terms, resp. term trees as a special case of term graphs and... (Update)
Context of citations to this paper: More
...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...
.... 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...
Cited by: More
Total-Single-Pushout Derivations for Internal Graph Attribution - Kahl (1998) (Correct)
Internally Typed Second-Order Term Graphs - Kahl (1998) (Correct)
The Higher-Order Programming System User Manual for HOPS Version.. - Kahl (1998) (Correct)
Similar documents (at the sentence level):
5.4%: Second-Order Syntax in HOPS and in RALF - Kahl, Hattensperger (1998) (Correct)
Active bibliography (related documents): More All
0.8: Algebraic Graph Derivations for Graphical Calculi - Kahl (1997) (Correct)
0.6: A Fibred Approach to Rewriting - How the Duality between Adding.. - Kahl (1997) (Correct)
0.5: Term Graph Rewriting - Plump (1998) (Correct)
Similar documents based on text: More All
0.2: Inequational Deduction as Term Graph Rewriting - Corradini, Gadducci, Kahl, König (Correct)
0.1: The Term Graph Programming System - Kahl (Correct)
0.1: A Study on Symmetric Quotients - Furusawa, Kahl (1998) (Correct)
Related documents from co-citation: More All
3: al Centre Tracts 127, Centre for Mathematics and Computer Science (context) - Klop, systems - 1980
3: EATCS Monographs on Theoretical Computer Science (context) - Schmidt, Strohlein et al. - 1993
3: Prentice Hall International Series in Computer Science (context) - Spivey, Notation et al. - 1992
BibTeX entry: (Update)
Wolfram Kahl. Relational treatment of term graphs with bound variables. Journal of the IGPL, 1997. to appear. http://citeseer.ist.psu.edu/kahl98relational.html More
@misc{ kahl97relational,
author = "W. Kahl",
title = "Relational treatment of term graphs with bound variables",
text = "Wolfram Kahl. Relational treatment of term graphs with bound variables.
Journal of the IGPL, 1997. to appear.",
year = "1997",
url = "citeseer.ist.psu.edu/kahl98relational.html" }
Citations (may not include all citations):788 Rewrite systems - Dershowitz, Jouannaud - 1990
200 Prentice Hall International Series in Computer Science (context) - Spivey, Notation et al. - 1989
126 Higher-order critical pairs (context) - Nipkow - 1991
121 Proving and applying program transformations expressed with .. (context) - Huet, Lang - 1978
90 Theoretical Computer Science (context) - Raoult, rewritings - 1984
79 Graph-Grammars and Their Application to Computer Science (context) - Ehrig, Kreowski et al. - 1990
79 Graph-Grammars and Their Application to Computer Science and.. (context) - Claus, Ehrig et al. - 1978
75 The geometry of optimal lambda reduction - Gonthier, Abadi et al. - 1993
63 Theoretical Computer Science (context) - Padawitz, operational - 1982
61 Term Graph Rewriting: Theory and Practice (context) - Sleep, Plasmeijer et al. - 1993
47 Relational Methods in Computer Science - Brink, Kahl et al. - 1997
45 Graph grammars: An algebraic approach (context) - Ehrig, Pfender et al. - 1973
42 EATCS-Monographs on Theoretical Computer Science (context) - Schmidt, Strohlein et al. - 1993
24 An algorithm for optimal lambda calculus reduction (context) - Lamping - 1990
22 Cyclic lambda graph rewriting - Ariola, Klop - 1994
21 Evaluation of Functional Expressions by Hypergraph Rewriting (context) - Plump - 1993
18 On Graph Rewritings (context) - Kennaway - 1987
16 Graph rewriting in some categories of partial morphisms - Kennaway
16 Semantics and Pragmatics of the Lambda Calculus (context) - Wadsworth - 1971
16 term graph rewriting is adequate for rational parallel term .. (context) - Corradini, Drewes - 1995
14 The Adequacy of Term Graph Rewriting for Simulating Term Rew.. (context) - Kennaway, Klop et al. - 1993
14 Computation on graph-like expressions (context) - Staples - 1980
13 Algebraic approach to graph transformation based on single p.. (context) - Lowe - 1990
9 Algebraische Termgraphersetzung mit gebundenen Variablen (context) - Kahl - 1996
7 Term graph rewriting and garbage collection using opfibratio.. (context) - Banach - 1994
7 A graph-like lambda calculus for which leftmost-outermost re.. (context) - Staples
6 Optimal evaluations of graph-like expressions (context) - Staples - 1980
6 al Centre Tracts 127, Centre for Mathematics and Computer Sc.. (context) - Klop, systems - 1980
5 Relation-algebraic domain constructions (context) - Zierer - 1991
5 Optimal Interpreters for Lambda-Calculus Based Functional La.. (context) - Kathail - 1990
4 Kategorien von Termgraphen mit gebundenen Variablen (context) - Kahl - 1995
4 Information Processing Letters (context) - Berghammer, Schmidt et al. - 1989
4 The Higher-Object Programming System (context) - Bayer, Kahl - 1994
4 and equational unification: the higher-order cases (context) - Wolfram - 1991
4 and equational unification: the higher-order cases (context) - Wolfram
4 A fibred approach to rewriting --- how the duality between a.. - Kahl - 1997
3 Rational rewriting (context) - Inverardi, Zilli - 1994
3 Livre 1: Theorie des Ensembles (context) - Bourbaki - 1970
2 Programmierung mit Funktionsobjekten: Konstruktive Erzeugung.. (context) - Zierer - 1988
2 and Jaap van der Woude (context) - Backhouse, de Bruin et al. - 1991
2 Laboratory for Computer Science (context) - Asperti, Laneve et al. - 1993
1 and Department of Maths and Computing Science (context) - Backhouse, de Bruin et al. - 1990
1 Comparing two di#erent approaches to products in abstract re.. (context) - Berghammer, Haeberer et al. - 1993
1 volume 488 of LNCS (context) - Techniques, th et al. - 1991
Documents on the same site (http://www.oup.co.uk/igpl/Volume_06/Issue_02/): More
Taming First-Order Logic - Mikulas (1998) (Correct)
A Collective Extension of Relational Grammar - Böttner (1998) (Correct)
A Relational Model for Temporal Logic - von Karger, Berghammer (1998) (Correct)
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