On the public citation graph

A higher-order removal method

https://doi.org/10.1007/bf01806315
0 signed · 45 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-10003-2_58openalex-snapshot
Languages with reducing reflexive types
inferredcites →https://doi.org/10.1007/3-540-15975-4_37openalex-snapshot
Lambda lifting: Transforming programs to recursive equations
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-19027-9_23openalex-snapshot
Deforestation: Transforming programs to eliminate trees
inferredcites →https://doi.org/10.1007/3540543961_23openalex-snapshot
Finiteness analysis
inferredcites →https://doi.org/10.1007/978-1-4471-3166-3_9openalex-snapshot
Transformation in a Non-Strict Language: An Approach to Instantiation
inferredcites →https://doi.org/10.1007/bf01806312openalex-snapshot
Mix: A self-applicable partial evaluator for experiments in compiler generation
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(90)90147-aopenalex-snapshot
Deforestation: transforming programs to eliminate trees
inferredcites →https://doi.org/10.1017/s0956796800001179openalex-snapshot
Safe fusion of functional expressions II: Further improvements
inferredcites →https://doi.org/10.1093/comjnl/32.2.127openalex-snapshot
The Chalmers Lazy-ML Compiler
inferredcites →https://doi.org/10.1093/comjnl/32.2.98openalex-snapshot
Why Functional Programming Matters
inferredcites →https://doi.org/10.1145/130697.130699openalex-snapshot
Report on the programming language Haskell
inferredcites →https://doi.org/10.1145/141471.141494openalex-snapshot
Safe fusion of functional expressions
inferredcites →https://doi.org/10.1145/143165.143169openalex-snapshot
The essence of functional programming
inferredcites →https://doi.org/10.1145/1780.1803openalex-snapshot
Transformations and reduction strategies for typed lambda expressions
inferredcites →https://doi.org/10.1145/199448.199485openalex-snapshot
Total correctness by local improvement in program transformation
inferredcites →https://doi.org/10.1145/321992.321996openalex-snapshot
A Transformation System for Developing Recursive Programs
inferredcites →https://doi.org/10.1145/800068.802129openalex-snapshot
Super-combinators a new implementation method for applicative languages
inferredcites →https://doi.org/10.1145/800194.805852openalex-snapshot
Definitional interpreters for higher-order programming languages
inferredcites →https://doi.org/10.1145/91556.91622openalex-snapshot
Abstracting control
inferredcites →https://doi.org/10.1145/99370.99375openalex-snapshot
Computer-time garbage collection by sharing analysis
inferredcites →https://doi.org/10.1145/99370.99380openalex-snapshot
Transformations on higher-order functions
inferredcites →https://doi.org/10.1145/99370.99404openalex-snapshot
Theorems for free!
inferredcites →https://doi.org/10.6083/5d86p055popenalex-snapshot
Defunctionalization of typed programs

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-030-13838-7_8openalex-snapshot
Predicate Specialization for Definitional Higher-Order Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-75292-9_28openalex-snapshot
Quasi-interpretation Synthesis by Decomposition
inferred← citeshttps://doi.org/10.1007/978-3-662-48899-7_16openalex-snapshot
TIP: Tools for Inductive Provers
inferred← citeshttps://doi.org/10.1007/bfb0026823openalex-snapshot
Better consumers for deforestation
inferred← citeshttps://doi.org/10.1016/j.scico.2017.09.002openalex-snapshot
Higher-order logic programming: An expressive language for representing qualitative preferences
inferred← citeshttps://doi.org/10.1017/s0956796804005489openalex-snapshot
A parallel SML compiler based on algorithmic skeletons
inferred← citeshttps://doi.org/10.1017/s0956796897002633openalex-snapshot
First-order functional languages and intensional logic
inferred← citeshttps://doi.org/10.1017/s0956796898003086openalex-snapshot
From ML to Ada: Strongly-typed language interoperability via source translation
inferred← citeshttps://doi.org/10.1017/s0956796899003445openalex-snapshot
Higher-order functional languages and intensional logic
inferred← citeshttps://doi.org/10.1145/1596638.1596641openalex-snapshot
Losing functions without gaining data
inferred← citeshttps://doi.org/10.1145/2427048.2427051openalex-snapshot
From HOT to COOL
inferred← citeshttps://doi.org/10.1145/258948.258953openalex-snapshot
Type-driven defunctionalization
inferred← citeshttps://doi.org/10.1145/258948.258965openalex-snapshot
A bounds inference method for vector-based memoization
inferred← citeshttps://doi.org/10.1145/258949.258953openalex-snapshot
Type-driven defunctionalization
inferred← citeshttps://doi.org/10.1145/258949.258965openalex-snapshot
A bounds inference method for vector-based memoization
inferred← citeshttps://doi.org/10.1145/3591241openalex-snapshot
Defunctionalization with Dependent Types
inferred← citeshttps://doi.org/10.15480/882.1071openalex-snapshot
A transformational approach to generic software development based on higher-order, typed functional signatures
inferred← citeshttps://doi.org/10.2298/csis130923030fopenalex-snapshot
Modular polymorphic defunctionalization
inferred← citeshttps://doi.org/10.48456/tr-824openalex-snapshot
Hardware synthesis from a stream-processing functional language
inferred← citeshttps://doi.org/10.48550/arxiv.1808.04176openalex-snapshot
Predicate Specialization for Definitional Higher-order Logic Programs
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.