On the public citation graph

On the synthesis of function inverses

0 signed · 28 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-51081-8_139openalex-snapshot
InvX: An automatic function inverter
inferredcites →https://doi.org/10.1007/3540512845_46openalex-snapshot
A Functional Programming environment supporting execution, partial execution and transformation
inferredcites →https://doi.org/10.1007/3540543961_13openalex-snapshot
A projection model of types
inferredcites →https://doi.org/10.1016/0022-0000(78)90014-4openalex-snapshot
A theory of type polymorphism in programming
inferredcites →https://doi.org/10.1016/0304-3975(92)90213-yopenalex-snapshot
A new approach to recursion removal
inferredcites →https://doi.org/10.1016/0890-5401(91)90004-lopenalex-snapshot
Inverse image analysis generalises strictness analysis
inferredcites →https://doi.org/10.1093/comjnl/35.2.138openalex-snapshot
The Mechanical Transformation of Data Types
inferredcites →https://doi.org/10.1137/0205035openalex-snapshot
A Powerdomain Construction
inferredcites →https://doi.org/10.1145/321250.321253openalex-snapshot
A Machine-Oriented Logic Based on the Resolution Principle
inferredcites →https://doi.org/10.1145/359576.359579openalex-snapshot
Can programming be liberated from the von Neumann style?
inferredcites →https://doi.org/10.1145/800223.806761openalex-snapshot
Transformations of FP program schemes

What points at this work

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

inferred← citeshttps://doi.org/10.1007/10722010_13openalex-snapshot
The Universal Resolving Algorithm: Inverse Computation in a Functional Language
inferred← citeshttps://doi.org/10.1007/3-540-18088-5_3openalex-snapshot
Inverse image analysis
inferred← citeshttps://doi.org/10.1007/3-540-36377-7_13openalex-snapshot
Principles of Inverse Computation and the Universal Resolving Algorithm
inferred← citeshttps://doi.org/10.1007/3-540-45442-x_13openalex-snapshot
Inverting Functions as Folds
inferred← citeshttps://doi.org/10.1007/3-540-58485-4_58openalex-snapshot
Mechanical elimination of commutative redundancy
inferred← citeshttps://doi.org/10.1007/978-3-540-40018-9_18openalex-snapshot
Rebuilding a Tree from Its Traversals:
inferred← citeshttps://doi.org/10.1007/978-3-642-38197-3_11openalex-snapshot
Improving Determinization of Grammar Programs for Program Inversion
inferred← citeshttps://doi.org/10.1007/bf01211087openalex-snapshot
Running programs backwards: The logical inversion of imperative computation
inferred← citeshttps://doi.org/10.1007/bf03160224openalex-snapshot
Inverse computation and the Universal Resolving Algorithm
inferred← citeshttps://doi.org/10.1016/0164-1212(95)00095-xopenalex-snapshot
Space-efficient memo-functions
inferred← citeshttps://doi.org/10.1016/j.scico.2003.09.003openalex-snapshot
Theory and applications of inverting functions as folds
inferred← citeshttps://doi.org/10.1016/s0167-6423(02)00023-0openalex-snapshot
The universal resolving algorithm and its correctness: inverse computation in a functional language
inferred← citeshttps://doi.org/10.1017/s0960129500000360openalex-snapshot
Categories, relations and dynamic programming
inferred← citeshttps://doi.org/10.1145/328690.328700openalex-snapshot
From recursion to iteration
inferred← citeshttps://doi.org/10.1145/328691.328700openalex-snapshot
From recursion to iteration
inferred← citeshttps://doi.org/10.1145/3414080.3414089openalex-snapshot
Inversion Framework: Reasoning about Inversion by Conditional Term Rewriting Systems
inferred← citeshttps://doi.org/10.1145/3729314openalex-snapshot
Multi-stage Relational Programming
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.