On the public citation graph

Systematics of transformation rules

https://doi.org/10.1007/bfb0014672
0 signed · 50 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.1007/3-540-07994-7openalex-snapshot
Language Hierarchies and Interfaces
inferredcites →https://doi.org/10.1007/3-540-07994-7_55openalex-snapshot
A philosophy of programming
inferredcites →https://doi.org/10.1007/3540069585_50openalex-snapshot
Transformational Grammars
inferredcites →https://doi.org/10.1007/978-1-4899-5841-9_3openalex-snapshot
Semantics of Programming Languages
inferredcites →https://doi.org/10.1007/978-3-642-61807-9openalex-snapshot
Algorithmic Language and Program Development
inferredcites →https://doi.org/10.1007/bf00263742openalex-snapshot
A system which automatically improves programs
inferredcites →https://doi.org/10.1007/bf00264597openalex-snapshot
A synthesis of several sorting algorithms
inferredcites →https://doi.org/10.1007/bfb0014671openalex-snapshot
Program development by stepwise transformations — The project CIP
inferredcites →https://doi.org/10.1007/bfb0014673openalex-snapshot
Special transformation techniques
inferredcites →https://doi.org/10.1007/bfb0014674openalex-snapshot
A study on transformational semantics
inferredcites →https://doi.org/10.1007/bfb0014675openalex-snapshot
Detailization and lazy evaluation, infinite objects and pointer representation
inferredcites →https://doi.org/10.1007/bfb0014676openalex-snapshot
Examples for change of types and object structures
inferredcites →https://doi.org/10.1007/bfb0014683openalex-snapshot
Semantics of nondeterministic and noncontinuous constructs
inferredcites →https://doi.org/10.1016/0020-0190(76)90015-6openalex-snapshot
A family of rules for recursion removal
inferredcites →https://doi.org/10.1016/0096-0551(78)90004-8openalex-snapshot
Functional combination
inferredcites →https://doi.org/10.1016/b978-1-55860-254-0.50007-1openalex-snapshot
PROGRAM TRANSFORMATIONS
inferredcites →https://doi.org/10.1016/s0022-0000(71)80036-3openalex-snapshot
Translating recursion equations into flow charts
inferredcites →https://doi.org/10.1093/comjnl/9.1.45openalex-snapshot
The Equivalence of Certain Computations
inferredcites →https://doi.org/10.1109/sfcs.1976.3openalex-snapshot
Algebraic families of interpretations
inferredcites →https://doi.org/10.1109/tse.1976.233533openalex-snapshot
Goal-Directed Program Transformation
inferredcites →https://doi.org/10.1109/tse.1976.233834openalex-snapshot
Control Structure Abstractions of the Backtracking Programming Technique
inferredcites →https://doi.org/10.1145/1344551.1344563openalex-snapshot
Comparative schematology
inferredcites →https://doi.org/10.1145/321738.321750openalex-snapshot
Tree-Manipulating Systems and Church-Rosser Theorems
inferredcites →https://doi.org/10.1145/321992.321996openalex-snapshot
A Transformation System for Developing Recursive Programs
inferredcites →https://doi.org/10.1145/321992.322000openalex-snapshot
Program Improvement by Source-to-Source Transformation
inferredcites →https://doi.org/10.1145/390016.808470openalex-snapshot
Some transformations for developing recursive programs
inferredcites →https://doi.org/10.1145/512976.512983openalex-snapshot
Correctness-preserving program transformations
inferredcites →https://doi.org/10.1145/800161.805164openalex-snapshot
Translating recursion equations into flow charts
inferredcites →https://doi.org/10.1145/800191.805652openalex-snapshot
Improving and refining programs by program manipulation
inferredcites →https://doi.org/10.1145/954587.954588openalex-snapshot
Towards a wide spectrum language to support program specification and program development

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-09981-6_22openalex-snapshot
Suggestions for composing and specifying program design decisions
inferred← citeshttps://doi.org/10.1007/3-540-16446-4_2openalex-snapshot
Convergent term rewriting systems can be used for program transformation
inferred← citeshttps://doi.org/10.1007/978-3-642-10619-4_18openalex-snapshot
Abstracting Models from Execution Traces for Performing Formal Verification
inferred← citeshttps://doi.org/10.1007/978-3-642-46490-4_18openalex-snapshot
Algebraic Methods for Program Construction: The Project CIP
inferred← citeshttps://doi.org/10.1007/978-94-009-7019-9_1openalex-snapshot
Program Construction by Transformations: A Family Tree of Sorting Programs
inferred← citeshttps://doi.org/10.1007/bf00264438openalex-snapshot
Deriving very efficient algorithms for evaluating linear recurrence relations using the program transformation technique
inferred← citeshttps://doi.org/10.1007/bf00291051openalex-snapshot
A calculus of refinements for program derivations
inferred← citeshttps://doi.org/10.1007/bf01101651openalex-snapshot
Semantics of algorithmic languages
inferred← citeshttps://doi.org/10.1007/bfb0014673openalex-snapshot
Special transformation techniques
inferred← citeshttps://doi.org/10.1007/s002360050151openalex-snapshot
A transformation system for concurrent processes
inferred← citeshttps://doi.org/10.1016/0022-0000(81)90005-2openalex-snapshot
On correct refinement of programs
inferred← citeshttps://doi.org/10.1016/0167-6423(81)90006-xopenalex-snapshot
Programming in a wide spectrum language: a collection of examples
inferred← citeshttps://doi.org/10.1016/0167-6423(82)90017-xopenalex-snapshot
An exercise in program synthesis: algorithms for computing the transitive closure of a relation
inferred← citeshttps://doi.org/10.1016/0167-6423(83)90002-3openalex-snapshot
An exercise in the transformational derivation of an efficient program by joint development of control and data structure
inferred← citeshttps://doi.org/10.1016/0304-3975(83)90055-5openalex-snapshot
A continuous semantics for unbounded nondeterminism
inferred← citeshttps://doi.org/10.1016/s0169-023x(96)00045-6openalex-snapshot
Data schema design as a schema evolution process
inferred← citeshttps://doi.org/10.1109/32.21743openalex-snapshot
Formal program construction by transformations-computer-aided, intuition-guided programming
inferred← citeshttps://doi.org/10.1109/hol.1991.596289openalex-snapshot
Proof Of Program Transformations
inferred← citeshttps://doi.org/10.48550/arxiv.2105.12647openalex-snapshot
Conceptual Schema Optimisation -- Database Optimisation before sliding down the Waterfall
inferred← citeshttps://doi.org/10.5555/800091.802922openalex-snapshot
A system for program refinement
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.