On the public citation graph
Higher-order rewriting and partial evaluation
0 signed · 42 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.1007/3-540-15976-2_6openalex-snapshot
An experiment in partial evaluation: The generation of a compiler generator
inferredcites →https://doi.org/10.1007/3-540-58140-5_35openalex-snapshot
Weak orthogonality implies confluence: The higher-order case
inferredcites →https://doi.org/10.1007/3-540-58233-9_13openalex-snapshot
Comparing combinatory reduction systems and higher-order rewrite systems
inferredcites →https://doi.org/10.1007/bf01019462openalex-snapshot
Reasoning about programs in continuation-passing style
inferredcites →https://doi.org/10.1007/bf01019945openalex-snapshot
Call-by-need and continuation-passing style
inferredcites →https://doi.org/10.1007/bfb0037114openalex-snapshot
Orthogonal higher-order rewrite systems are confluent
inferredcites →https://doi.org/10.1016/0304-3975(75)90017-1openalex-snapshot
Call-by-name, call-by-value and the λ-calculus
inferredcites →https://doi.org/10.1016/0304-3975(93)90091-7openalex-snapshot
Combinatory reduction systems: introduction and survey
inferredcites →https://doi.org/10.1016/c2009-0-14341-6openalex-snapshot
The Lambda Calculus - Its Syntax and Semantics
inferredcites →https://doi.org/10.1017/cbo9780511609619openalex-snapshot
Compiling with Continuations
inferredcites →https://doi.org/10.1017/s0956796800000770openalex-snapshot
Correctness of binding-time analysis
inferredcites →https://doi.org/10.1017/s0960129500001535openalex-snapshot
Representing Control: a Study of the CPS Transformation
inferredcites →https://doi.org/10.1145/115865.115874openalex-snapshot
Optimization of equational programs using partial evaluation
inferredcites →https://doi.org/10.1145/158511.158707openalex-snapshot
Tutorial notes on partial evaluation
inferredcites →https://doi.org/10.1145/359138.359142openalex-snapshot
Proving termination with multiset orderings
inferredcites →https://doi.org/10.1145/382130.382133openalex-snapshot
Revised 4 report on the algorithmic language scheme
inferredcites →https://doi.org/10.1145/3916.3986openalex-snapshot
Program abstraction and instantiation
inferredcites →https://doi.org/10.1145/800068.802129openalex-snapshot
Super-combinators a new implementation method for applicative languages
inferredcites →https://doi.org/10.21236/ada292952openalex-snapshot
The Occurrence of Continuation Parameters in CPS Terms.
inferredcites →https://doi.org/10.5860/choice.46-1527openalex-snapshot
Essentials of programming languages
inferredcites →https://doi.org/10.7146/brics.v4i46.19267openalex-snapshot
Higher-Order Rewriting and Partial Evaluation
inferredcites →https://doi.org/10.7551/mitpress/2319.001.0001openalex-snapshot
The Definition of Standard ML
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/10721975openalex-snapshot
Rewriting Techniques and Applications: 11th International Conference, RTA 2000, Norwich, UK, July 10-12, 2000 Proceedings
inferred← citeshttps://doi.org/10.1007/3-540-44716-4_5openalex-snapshot
A Higher-Order Colon Translation
inferred← citeshttps://doi.org/10.1007/978-3-540-32033-3_11openalex-snapshot
Universal Algebra for Termination of Higher-Order Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-642-11999-6_5openalex-snapshot
Semantic Labelling for Proving Termination of Combinatory Reduction Systems
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80281-6openalex-snapshot
On proving syntactic properties of CPS programs
inferred← citeshttps://doi.org/10.1017/s0960129522000287openalex-snapshot
Complete algebraic semantics for second-order rewriting systems based on abstract syntax with variable binding
inferred← citeshttps://doi.org/10.7146/brics.v4i46.19267openalex-snapshot
Higher-Order Rewriting and Partial Evaluation
inferred← citeshttps://doi.org/10.7146/brics.v4i47.19268openalex-snapshot
Distributed Safety Controllers for Web Services
inferred← citeshttps://doi.org/10.7146/brics.v4i48.19269openalex-snapshot
CoFI: The Common Framework Initiative for Algebraic Specification and Development
inferred← citeshttps://doi.org/10.7146/brics.v4i50.19271openalex-snapshot
Sequential Iteration of Interactive Arguments and an Efficient Zero-Knowledge Argument for NP
inferred← citeshttps://doi.org/10.7146/brics.v4i51.19272openalex-snapshot
Some Lambda Calculus and Type Theory Formalized
inferred← citeshttps://doi.org/10.7146/brics.v4i52.19273openalex-snapshot
On the Finitary Characterization of pi-Congruences
inferred← citeshttps://doi.org/10.7146/brics.v4i53.19274openalex-snapshot
Online Type-Directed Partial Evaluation
inferred← citeshttps://doi.org/10.7146/brics.v6i23.20092openalex-snapshot
On proving syntactic properties of CPS programs
inferred← citeshttps://doi.org/10.7146/brics.v7i33.20168openalex-snapshot
A Higher-Order Colon Translation
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.