On the public citation graph

Convergence of program transformers in the metric space of trees

0 signed · 46 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-10828-9_59openalex-snapshot

Easy solutions are hard to find

inferredcites →https://doi.org/10.1007/3-540-19020-1openalex-snapshot

Mathematical Foundations of Programming Language Semantics

inferredcites →https://doi.org/10.1007/3-540-57880-3_32openalex-snapshot

Towards unifying partial evaluation, deforestation, supercompilation, and GPC

inferredcites →https://doi.org/10.1007/3-540-58402-1_13openalex-snapshot

Partial deduction and driving are equivalent

inferredcites →https://doi.org/10.1007/3-540-61055-3_28openalex-snapshot

Narrowing-driven partial evaluation of functional logic programs

inferredcites →https://doi.org/10.1007/3-540-61580-6_13openalex-snapshot

Global control for partial deduction through characteristic atoms and global trees

inferredcites →https://doi.org/10.1007/3-540-61580-6_18openalex-snapshot

A comparative revisitation of some program transformation techniques

inferredcites →https://doi.org/10.1007/3-540-61580-6_8openalex-snapshot

A roadmap to metacomputation by supercompilation

inferredcites →https://doi.org/10.1007/3-540-61756-6_83openalex-snapshot

Controlling conjunctive partial deduction

inferredcites →https://doi.org/10.1007/3540543961_9openalex-snapshot

Automatic online partial evaluation

inferredcites →https://doi.org/10.1007/978-3-642-96826-6openalex-snapshot

Foundations of Logic Programming

inferredcites →https://doi.org/10.1007/bf02485827openalex-snapshot

A compactification of the algebra of terms

inferredcites →https://doi.org/10.1007/bfb0032402openalex-snapshot

The essence of program transformation by partial evaluation and driving

inferredcites →https://doi.org/10.1016/0022-0000(83)90041-7openalex-snapshot

All solutions of a system of recursion equations in infinite trees and other contraction theories

inferredcites →https://doi.org/10.1016/0304-3975(80)90045-6openalex-snapshot

Metric interpretations of infinite trees and semantics of non deterministic recursive programs

inferredcites →https://doi.org/10.1016/0304-3975(83)90059-2openalex-snapshot

Fundamental properties of infinite trees

inferredcites →https://doi.org/10.1016/0304-3975(90)90147-aopenalex-snapshot

Deforestation: transforming programs to eliminate trees

inferredcites →https://doi.org/10.1016/0743-1066(89)90033-2openalex-snapshot

Compiling control

inferredcites →https://doi.org/10.1016/0743-1066(93)90025-copenalex-snapshot

The loop absorption and the generalization strategies for the development of logic programs and partial deduction

inferredcites →https://doi.org/10.1016/s0747-7171(87)80022-6openalex-snapshot

Termination of rewriting

inferredcites →https://doi.org/10.1017/s0305004100003844openalex-snapshot

On well-quasi-ordering finite trees

inferredcites →https://doi.org/10.1017/s0956796800000745openalex-snapshot

On the specialization of online program specializers

inferredcites →https://doi.org/10.1017/s0956796800002008openalex-snapshot

A positive supercompiler

inferredcites →https://doi.org/10.1090/s0002-9947-1960-0111704-1openalex-snapshot

Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture

inferredcites →https://doi.org/10.1112/plms/s3-2.1.326openalex-snapshot

Ordering by Divisibility in Abstract Algebras

inferredcites →https://doi.org/10.1137/0209039openalex-snapshot

Vector Iteration in Pointed Iterative Theories

inferredcites →https://doi.org/10.1137/0209052openalex-snapshot

Compatible Orderings on the Metric Theory of Trees

inferredcites →https://doi.org/10.1145/321992.321996openalex-snapshot

A Transformation System for Developing Recursive Programs

inferredcites →https://doi.org/10.1145/356827.356831openalex-snapshot

Tabulation Techniques for Recursive Programs

inferredcites →https://doi.org/10.1145/5956.5957openalex-snapshot

The concept of a supercompiler

inferredcites →https://doi.org/10.1145/800055.802044openalex-snapshot

A powerful strategy for deriving efficient programs by transformation

inferredcites →https://doi.org/10.3233/fi-1980-3405openalex-snapshot

The metric space of infinite trees. Algebraic and topological properties

inferredcites →https://doi.org/10.7551/mitpress/4298.003.0059openalex-snapshot

Ensuring Global Termination of Partial Deduction While Allowing Flexible Polyvariance

inferredcites →https://doi.org/10.7551/mitpress/4301.003.0048openalex-snapshot

An Algorithm of Generalization in Positive Supercompilation

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-36377-7_17openalex-snapshot

Homeomorphic Embedding for Online Termination of Symbolic Methods

inferred← citeshttps://doi.org/10.1007/3-540-44957-4_7openalex-snapshot

Coverability of Reset Petri Nets and Other Well-Structured Transition Systems by Partial Deduction

inferred← citeshttps://doi.org/10.1007/3-540-46562-6_10openalex-snapshot

On Perfect Supercompilation

inferred← citeshttps://doi.org/10.1007/3-540-47018-2_10openalex-snapshot

Introduction to Supercompilation

inferred← citeshttps://doi.org/10.1007/3-540-48958-4_11openalex-snapshot

Improving Homeomorphic Embedding for Online Termination

inferred← citeshttps://doi.org/10.1007/978-3-642-40447-4_9openalex-snapshot

Towards a Framework for Building Formally Verified Supercompilers in Coq

inferred← citeshttps://doi.org/10.1016/s0167-6423(99)00026-xopenalex-snapshot

Convergence of program transformers in the metric space of trees

inferred← citeshttps://doi.org/10.1017/s147106840200145xopenalex-snapshot

Logic program specialisation through partial deduction: Control issues

inferred← citeshttps://doi.org/10.1134/s0361768812050027openalex-snapshot

Higher-level supercompilation as a metasystem transition

inferred← citeshttps://doi.org/10.29007/4vl2openalex-snapshot

On the Termination of Positive Supercompilation

inferred← citeshttps://doi.org/10.29007/t4gzopenalex-snapshot

Local Driving in Higher-Order Positive Supercompilation via the Omega-theorem

inferred← citeshttps://doi.org/10.4204/eptcs.341.5openalex-snapshot

An Empirical Study of Partial Deduction for miniKanren

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.