On the public citation graph
Rewriting Techniques and Applications: 11th International Conference, RTA 2000, Norwich, UK, July 10-12, 2000 Proceedings
0 signed · 27 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/inco.2000.2878openalex-snapshot
Ordering Constraints over Feature Trees Expressed in Second-Order Monadic Logic
inferredcites →https://doi.org/10.1007/3-540-45610-4_10openalex-snapshot
Regular Sets of Descendants by Some Rewrite Strategies
inferredcites →https://doi.org/10.1007/3-540-45610-4_7openalex-snapshot
Deriving Focused Lattice Calculi
inferredcites →https://doi.org/10.1007/3-540-45610-4_8openalex-snapshot
Layered Transducing Term Rewriting System and Its Recognizability Preserving Property
inferredcites →https://doi.org/10.1007/3-540-45610-4_9openalex-snapshot
Decidability and Closure Properties of Equational Tree Languages
inferredcites →https://doi.org/10.1007/bfb0052360openalex-snapshot
Decidable and undecidable second-order unification problems
inferredcites →https://doi.org/10.1007/bfb0052361openalex-snapshot
On the exponent of periodicity of minimal solutions of context equations
inferredcites →https://doi.org/10.1007/bfb0052373openalex-snapshot
Modularity of termination using dependency pairs
inferredcites →https://doi.org/10.1007/bfb0052377openalex-snapshot
Higher-order rewriting and partial evaluation
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1999.2837openalex-snapshot
Higher Order Unification via Explicit Substitutions
inferred← citeshttps://doi.org/10.1007/978-3-030-90716-7_10openalex-snapshot
Subsurface Evaluation Through Multi-scenario Reasoning
inferred← citeshttps://doi.org/10.1016/j.apal.2008.01.003openalex-snapshot
Strong normalization of classical natural deduction with disjunctions
inferred← citeshttps://doi.org/10.1016/j.cola.2022.101105openalex-snapshot
Automatic compiler/interpreter generation from programs for Domain-Specific Languages: Code bloat problem and performance improvement
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.10.008openalex-snapshot
Strength Induction in a Haskell Program Verifier
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.04.090openalex-snapshot
Coupled Transformation of Schemas, Documents, Queries, and Constraints
inferred← citeshttps://doi.org/10.1016/j.jlamp.2015.06.005openalex-snapshot
Symbol different term rewrite systems
inferred← citeshttps://doi.org/10.1016/j.jlamp.2021.100747openalex-snapshot
Associative unification in Maude
inferred← citeshttps://doi.org/10.1016/j.jsc.2004.12.011openalex-snapshot
A survey of strategies in rule-based program transformation systems
inferred← citeshttps://doi.org/10.1016/j.scico.2004.03.012openalex-snapshot
Architectural modifications to deployed software
inferred← citeshttps://doi.org/10.1016/j.scico.2010.01.003openalex-snapshot
Transformation of structure-shy programs with application to XPath queries and strategic functions
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.12.022openalex-snapshot
Intuitionistic differential nets and lambda-calculus
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.02.038openalex-snapshot
Introducing ⦇ λ ⦈, a λ-calculus for effectful computation
inferred← citeshttps://doi.org/10.1016/s0168-0072(02)00051-9openalex-snapshot
Church–Rosser property of a simple reduction for full first-order classical natural deduction
inferred← citeshttps://doi.org/10.1145/2103621.2103690openalex-snapshot
Static and user-extensible proof checking
inferred← citeshttps://doi.org/10.1145/2103656.2103690openalex-snapshot
Static and user-extensible proof checking
inferred← citeshttps://doi.org/10.1145/3382025.3414964openalex-snapshot
Consistency-preserving evolution planning on feature models
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.