On the public citation graph
A Functional Programming environment supporting execution, partial execution and transformation
0 signed · 30 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-10699-5_91openalex-snapshot
The algebra of functional programs: Function level reasoning, linear equations, and extended definitions
inferredcites →https://doi.org/10.1007/3-540-18317-5_16openalex-snapshot
Controlling the behaviour of functional language systems
inferredcites →https://doi.org/10.1007/3-540-18420-1_60openalex-snapshot
Graph reduction in a parallel virtual memory environment
inferredcites →https://doi.org/10.1007/3-540-51081-8_139openalex-snapshot
InvX: An automatic function inverter
inferredcites →https://doi.org/10.1038/218019a0openalex-snapshot
“Memo” Functions and Machine Learning
inferredcites →https://doi.org/10.1145/12276.13332openalex-snapshot
Efficient compilation of linear recursive functions into object level loops
inferredcites →https://doi.org/10.1145/2166.2167openalex-snapshot
Eliminating Redundant Recursive Calls.
inferredcites →https://doi.org/10.1145/321992.321996openalex-snapshot
A Transformation System for Developing Recursive Programs
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.806764openalex-snapshot
ALICE a multi-processor reduction machine for the parallel evaluation CF applicative languages
inferredcites →https://doi.org/10.21236/ada106750openalex-snapshot
Verification of Concurrent Programs. Part I. The Temporal Framework,
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.4330020302openalex-snapshot
Declarative languages and program transformation for programming parallel systems: A case study
inferred← citeshttps://doi.org/10.1002/cpe.4330070803openalex-snapshot
A toolkit for parallel functional programming
inferred← citeshttps://doi.org/10.1007/3-540-51081-8_102openalex-snapshot
Narrowing and unification in functional programming —An evaluation mechanism for absolute set abstraction
inferred← citeshttps://doi.org/10.1007/3-540-54444-5_87openalex-snapshot
Domesticating imperative constructs so that they can live in a functional world
inferred← citeshttps://doi.org/10.1007/3-540-60156-2_6openalex-snapshot
A general technique for automatically optimizing programs through the use of proof plans
inferred← citeshttps://doi.org/10.1007/bf01185679openalex-snapshot
On the synthesis of function inverses
inferred← citeshttps://doi.org/10.1016/s0167-6423(96)00015-9openalex-snapshot
The automated transformation of abstract specifications of numerical algorithms into efficient array processor implementations
inferred← citeshttps://doi.org/10.1017/s0956796800000629openalex-snapshot
An incremental, exploratory and transformational environment for lazy functional programming
inferred← citeshttps://doi.org/10.1017/s0956796800000927openalex-snapshot
An overview of the Flagship system
inferred← citeshttps://doi.org/10.1023/a:1005969312327openalex-snapshot
Recursive Program Optimization through Inductive Synthesis Proof Transformation
inferred← citeshttps://doi.org/10.1093/comjnl/35.6.555openalex-snapshot
A Higher-Order Approach to Parallel Algorithms
inferred← citeshttps://doi.org/10.1109/32.58788openalex-snapshot
KIDS: a semiautomatic program development system
inferred← citeshttps://doi.org/10.1109/empdp.1993.336410openalex-snapshot
Synthesis of the fast Fourier transform algorithm by functional language program transformation
inferred← citeshttps://doi.org/10.1109/netsoft54395.2022.9844061openalex-snapshot
From Category Theory to Functional Programming: A Formal Representation of Intent
inferred← citeshttps://doi.org/10.1145/122501.122504openalex-snapshot
Two models for integrating persistence and lazy functional languages
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.