On the public citation graph
FP²: Fully in-Place Functional Programming
0 signed · 64 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/11693024_3openalex-snapshot
Type-Based Amortised Heap-Space Analysis
inferredcites →https://doi.org/10.1007/11823230_17openalex-snapshot
Automated Verification of the Deutsch-Schorr-Waite Tree-Traversal Algorithm
inferredcites →https://doi.org/10.1007/3-540-18317-5_20openalex-snapshot
Clean — A language for functional graph rewriting
inferredcites →https://doi.org/10.1007/3-540-45332-6_7openalex-snapshot
Alias Types for Recursive Data Structures
inferredcites →https://doi.org/10.1007/3-540-45927-8_4openalex-snapshot
Another Type System for In-Place Update
inferredcites →https://doi.org/10.1007/3-540-46425-5_11openalex-snapshot
A Type System for Bounded Space and Functional In-Place Update—Extended Abstract
inferredcites →https://doi.org/10.1007/3-540-57840-4_34openalex-snapshot
OPAL: Design and implementation of an algebraic programming language
inferredcites →https://doi.org/10.1007/3-540-58402-1_9openalex-snapshot
Deriving residual reference count garbage collectors
inferredcites →https://doi.org/10.1007/3540543961_30openalex-snapshot
Unboxed values as first class citizens in a non-strict functional language
inferredcites →https://doi.org/10.1007/978-1-4471-3794-8_16openalex-snapshot
Generating Efficient Portable Code for a Strict Applicative Language
inferredcites →https://doi.org/10.1007/978-1-4842-7077-6_3openalex-snapshot
Introduction to Algorithms
inferredcites →https://doi.org/10.1007/978-3-030-34175-6_13openalex-snapshot
Mimalloc: Free List Sharding in Action
inferredcites →https://doi.org/10.1007/978-3-540-85373-2_12openalex-snapshot
Uniqueness Typing Simplified
inferredcites →https://doi.org/10.1007/978-3-642-04652-0_3openalex-snapshot
From Reduction-Based to Reduction-Free Normalization
inferredcites →https://doi.org/10.1007/978-3-642-28869-2_19openalex-snapshot
Fictional Separation Logic
inferredcites →https://doi.org/10.1016/0020-0190(86)90059-1openalex-snapshot
A novel representation of lists and its application to the function “reverse”
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/j.tcs.2006.12.036openalex-snapshot
Relational separation logic
inferredcites →https://doi.org/10.1016/s0890-5401(03)00009-9openalex-snapshot
Linear types and non-size-increasing polynomial time computation
inferredcites →https://doi.org/10.1017/s0956796805005769openalex-snapshot
Finger trees: a simple general-purpose data structure
inferredcites →https://doi.org/10.1017/s0956796807006399openalex-snapshot
A type system with usage aspects
inferredcites →https://doi.org/10.1017/s0956796899003494openalex-snapshot
Red-black trees in a functional setting
inferredcites →https://doi.org/10.1109/lics.2002.1029817openalex-snapshot
Separation logic: a logic for shared mutable data structures
inferredcites →https://doi.org/10.1145/1328438.1328474openalex-snapshot
Clowns to the left of me, jokers to the right (pearl)
inferredcites →https://doi.org/10.1145/155090.155113openalex-snapshot
The essence of compiling with continuations
inferredcites →https://doi.org/10.1145/185009.185016openalex-snapshot
Minimizing reference count updating with deferred and anchored pointers for functional data structures
inferredcites →https://doi.org/10.1145/1926385.1926427openalex-snapshot
Multivariate amortized resource analysis
inferredcites →https://doi.org/10.1145/318593.318660openalex-snapshot
The aggregate update problem in functional programming systems
inferredcites →https://doi.org/10.1145/319838.319855openalex-snapshot
Mechanisms for efficient multiprocessor combinator reduction
inferredcites →https://doi.org/10.1145/319838.319876openalex-snapshot
A semantic model of reference counting and its abstraction (detailed summary)
inferredcites →https://doi.org/10.1145/3406088.3409026openalex-snapshot
Finger trees explained anew, and slightly simplified (functional pearl)
inferredcites →https://doi.org/10.1145/3453483.3454032openalex-snapshot
Perceus: garbage free reference counting with reuse
inferredcites →https://doi.org/10.1145/3498672openalex-snapshot
A separation logic for heap space under garbage collection
inferredcites →https://doi.org/10.1145/3547634openalex-snapshot
Reference counting with frame limited reuse
inferredcites →https://doi.org/10.1145/3571218openalex-snapshot
A High-Level Separation Logic for Heap Space under Garbage Collection (Extended Version)
inferredcites →https://doi.org/10.1145/3571233openalex-snapshot
Tail Recursion Modulo Context: An Equational Approach
inferredcites →https://doi.org/10.1145/3607840openalex-snapshot
FP²: Fully in-Place Functional Programming
inferredcites →https://doi.org/10.1145/363534.363554openalex-snapshot
An efficient machine-independent procedure for garbage collection in various list structures
inferredcites →https://doi.org/10.1145/604131.604148openalex-snapshot
Static prediction of heap space usage for first-order functional programs
inferredcites →https://doi.org/10.1145/800055.802032openalex-snapshot
Some practical methods for rapid combinator reduction
inferredcites →https://doi.org/10.1145/800194.805852openalex-snapshot
Definitional interpreters for higher-order programming languages
inferredcites →https://doi.org/10.2307/1995158openalex-snapshot
The Principal Type-Scheme of an Object in Combinatory Logic
inferredcites →https://doi.org/10.5281/zenodo.7988149openalex-snapshot
FP^2: Fully in-Place Functional Programming Artifact
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-031-74558-4_10openalex-snapshot
Flattening Combinations of Arrays and Records
inferred← citeshttps://doi.org/10.1017/s0956796824000133openalex-snapshot
From high to low: Simulating nondeterminism and state with state
inferred← citeshttps://doi.org/10.1017/s0956796825100117openalex-snapshot
Tail recursion modulo context: An equational approach (extended version)
inferred← citeshttps://doi.org/10.1145/3649848openalex-snapshot
Functional Ownership through Fractional Uniqueness
inferred← citeshttps://doi.org/10.1145/3656398openalex-snapshot
The Functional Essence of Imperative Binary Search Trees
inferred← citeshttps://doi.org/10.1145/3674642openalex-snapshot
Oxidizing OCaml with Modal Memory Management
inferred← citeshttps://doi.org/10.1145/3689755openalex-snapshot
Realistic Realizability: Specifying ABIs You Can Count On
inferred← citeshttps://doi.org/10.1145/3716312openalex-snapshot
Will It Fit? Verifying Heap Space Bounds of Concurrent Programs under Garbage Collection
inferred← citeshttps://doi.org/10.1145/3720423openalex-snapshot
Destination Calculus: A Linear 𝜆-Calculus for Purely Functional Memory Writes
inferred← citeshttps://doi.org/10.1145/3796230openalex-snapshot
LeanMachines: State-based Modeling with Refinement (a Lean4 Framework)
inferred← citeshttps://doi.org/10.70675/7bb9b51ezf689z4cb5z8d80z794397b5f052openalex-snapshot
Algebraic Data Types for High-Performance Computing
showing the first 12 of 13 · page through all 13
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.