On the public citation graph

Synthesized and inherited functions

https://doi.org/10.1007/bf01178667
0 signed · 44 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/inco.1995.1016openalex-snapshot
Attributed Tree Transducers Cannot Induce All Deterministic Bottom-up Tree Transformations
inferredcites →https://doi.org/10.1007/3-540-18771-5_41openalex-snapshot
May we introduce to you: Hyperedge replacement
inferredcites →https://doi.org/10.1007/978-1-4612-6228-2openalex-snapshot
The Denotational Description of Programming Languages
inferredcites →https://doi.org/10.1007/978-1-4613-9623-9openalex-snapshot
The Synthesizer Generator
inferredcites →https://doi.org/10.1007/978-3-642-72248-6_5openalex-snapshot
Attributed Tree Transducers
inferredcites →https://doi.org/10.1007/bf01178504openalex-snapshot
Context-free hypergraph grammars have the same term-generating power as attribute grammars
inferredcites →https://doi.org/10.1007/bf01692060openalex-snapshot
Graph expressions and graph rewritings
inferredcites →https://doi.org/10.1007/bf01692511openalex-snapshot
Semantics of context-free languages
inferredcites →https://doi.org/10.1007/bf01695769openalex-snapshot
Mappings and grammars on trees
inferredcites →https://doi.org/10.1007/bf02737108openalex-snapshot
Composition and evaluation of attribute coupled grammars
inferredcites →https://doi.org/10.1016/0022-0000(85)90066-2openalex-snapshot
Macro tree transducers
inferredcites →https://doi.org/10.1016/0022-0000(91)90018-zopenalex-snapshot
The string generating power of context-free hypergraph grammars
inferredcites →https://doi.org/10.1016/0096-0551(89)90034-9openalex-snapshot
The Synthesizer Generator: A system for constructing language-based editors
inferredcites →https://doi.org/10.1016/0167-6423(91)90009-mopenalex-snapshot
Functional description of the contextual analysis in block-structured programming languages: a case study of tree transducers
inferredcites →https://doi.org/10.1016/0304-3975(82)90003-2openalex-snapshot
Attribute grammars and recursive program schemes I
inferredcites →https://doi.org/10.1016/0304-3975(82)90024-xopenalex-snapshot
Attribute grammars and recursive program schemes II
inferredcites →https://doi.org/10.1016/0304-3975(86)90052-6openalex-snapshot
Pushdown machines for the macro tree transducer
inferredcites →https://doi.org/10.1016/0304-3975(87)90102-2openalex-snapshot
An axiomatic definition of context-free rewriting and its application to NLC graph grammars
inferredcites →https://doi.org/10.1016/0304-3975(93)90191-uopenalex-snapshot
Tree transducers with external functions
inferredcites →https://doi.org/10.1016/b978-0-12-115350-2.50014-2openalex-snapshot
SOME OPEN QUESTIONS AND RECENT RESULTS ON TREE TRANSDUCERS AND TREE LANGUAGES11Preparation of this paper was supported in part by the National Science Foundation under Grant No. MCS79-04012.
inferredcites →https://doi.org/10.1016/s0019-9958(71)90706-6openalex-snapshot
Translations on a context free grammar
inferredcites →https://doi.org/10.1016/s0022-0000(05)80050-9openalex-snapshot
The translation power of top-down tree-to-graph transducers
inferredcites →https://doi.org/10.1016/s0022-0000(70)80017-4openalex-snapshot
Generalized2 sequential machine maps
inferredcites →https://doi.org/10.1109/jrproc.1953.274273openalex-snapshot
Computers and Automata
inferredcites →https://doi.org/10.1145/321992.321997openalex-snapshot
Initial Algebra Semantics and Continuous Algebras
inferredcites →https://doi.org/10.1145/322217.322230openalex-snapshot
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
inferredcites →https://doi.org/10.1145/357980.357986openalex-snapshot
A syntax directed compiler for ALGOL 60
inferredcites →https://doi.org/10.1145/358746.358755openalex-snapshot
The Cornell program synthesizer
inferredcites →https://doi.org/10.1145/366062.366083openalex-snapshot
A syntax directed compiler for ALGOL 60
inferredcites →https://doi.org/10.1145/567532.567544openalex-snapshot
Incremental evaluation for attribute grammars with application to syntax-directed editors
inferredcites →https://doi.org/10.1145/73141.74830openalex-snapshot
Higher order attribute grammars
inferredcites →https://doi.org/10.18725/oparu-1060openalex-snapshot
Synthesized and inherited functions - a new computational model for syntax-directed semantics
inferredcites →https://doi.org/10.2307/1968867openalex-snapshot
On Theories with a Combinatorial Definition of "Equivalence"
inferredcites →https://doi.org/10.4064/-21-1-257-275openalex-snapshot
Functional compiler description

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/jcss.1998.1573openalex-snapshot
The Equivalence of Bottom-Up and Top-Down Tree-to-Graph Transducers
inferred← citeshttps://doi.org/10.1006/jcss.1999.1684openalex-snapshot
A Comparison of Tree Transductions Defined by Monadic Second Order Logic and by Attribute Grammars
inferred← citeshttps://doi.org/10.1007/10705424_8openalex-snapshot
Comparison of Deforestation Techniques for Functional Programs and for Tree Transducers
inferred← citeshttps://doi.org/10.1007/3-540-61064-2_28openalex-snapshot
A pumping lemma for output languages of macro tree transducers
inferred← citeshttps://doi.org/10.1007/978-3-540-49382-2_13openalex-snapshot
Benefits of Tree Transducers for Optimizing Functional Programs
inferred← citeshttps://doi.org/10.1007/bfb0036191openalex-snapshot
A two-dimensional hierarchy for attributed tree transducers
inferred← citeshttps://doi.org/10.1007/s00224-008-9125-yopenalex-snapshot
Composing Stack-Attributed Tree Transducers
inferred← citeshttps://doi.org/10.1007/s00236-003-0120-0openalex-snapshot
A comparison of pebble tree transducers with macro tree transducers
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.10.030openalex-snapshot
XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles
inferred← citeshttps://doi.org/10.1145/1065167.1065203openalex-snapshot
XML type checking with macro tree transducers
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.