On the public citation graph

Recurrence extraction for functional programs through call-by-push-value

https://doi.org/10.1145/3371083
0 signed · 51 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.1006/inco.2000.2930openalex-snapshot
Full Abstraction for PCF
inferredcites →https://doi.org/10.1007/3-540-45315-6_1openalex-snapshot
Adequacy for Algebraic Effects
inferredcites →https://doi.org/10.1007/978-94-007-0954-6openalex-snapshot
Call-By-Push-Value
inferredcites →https://doi.org/10.1007/s10990-006-0480-6openalex-snapshot
Call-by-push-value: Decomposing call-by-value and call-by-name
inferredcites →https://doi.org/10.1016/0304-3975(77)90044-5openalex-snapshot
LCF considered as a programming language
inferredcites →https://doi.org/10.1016/0304-3975(77)90053-6openalex-snapshot
Fully abstract models of typed λ-calculi
inferredcites →https://doi.org/10.1016/j.ic.2008.12.003openalex-snapshot
Operational domain theory and topology of sequential programming languages
inferredcites →https://doi.org/10.1016/j.tcs.2003.10.022openalex-snapshot
Automated higher-order complexity analysis
inferredcites →https://doi.org/10.1016/j.tcs.2011.07.009openalex-snapshot
Cost analysis of object-oriented bytecode programs
inferredcites →https://doi.org/10.1017/cbo9780511526565openalex-snapshot
Axiomatic Domain Theory in Categories of Partial Maps
inferredcites →https://doi.org/10.1017/cbo9780511526619openalex-snapshot
Semantics and Logics of Computation
inferredcites →https://doi.org/10.1017/cbo9781139166386openalex-snapshot
Mathematical Theory of Domains
inferredcites →https://doi.org/10.1017/cbo9781316092415openalex-snapshot
Thinking Functionally with Haskell
inferredcites →https://doi.org/10.1017/s0960129500000293openalex-snapshot
Fully abstract translations between functional languages
inferredcites →https://doi.org/10.1137/0606031openalex-snapshot
Amortized Computational Complexity
inferredcites →https://doi.org/10.1142/6284openalex-snapshot
Domain-Theoretic Foundations of Functional Programming
inferredcites →https://doi.org/10.1145/1328438.1328457openalex-snapshot
Lightweight semiformal time complexity analysis for purely functional data structures
inferredcites →https://doi.org/10.1145/195613.195632openalex-snapshot
Probabilistic recurrence relations
inferredcites →https://doi.org/10.1145/224164.224210openalex-snapshot
Parallelism in sequential functional languages
inferredcites →https://doi.org/10.1145/2428116.2428123openalex-snapshot
A static cost analysis for a higher-order language
inferredcites →https://doi.org/10.1145/2499937.2499943openalex-snapshot
On the Inference of Resource Usage Upper and Lower Bounds
inferredcites →https://doi.org/10.1145/258948.258973openalex-snapshot
Functional reactive animation
inferredcites →https://doi.org/10.1145/2784731.2784749openalex-snapshot
Denotational cost semantics for functional languages with inductive types
inferredcites →https://doi.org/10.1145/2784731.2784753openalex-snapshot
Analysing the complexity of functional programs: higher-order meets first-order
inferredcites →https://doi.org/10.1145/3009837.3009842openalex-snapshot
Towards automatic resource bound analysis for OCaml
inferredcites →https://doi.org/10.1145/3110287openalex-snapshot
Automating sized-type inference for complexity analysis
inferredcites →https://doi.org/10.1145/3158142openalex-snapshot
Non-linear reasoning for invariant synthesis
inferredcites →https://doi.org/10.1145/3274278openalex-snapshot
Parallel Cost Analysis
inferredcites →https://doi.org/10.1145/361002.361016openalex-snapshot
Mechanical program analysis
inferredcites →https://doi.org/10.2168/lmcs-3(1:9)2007openalex-snapshot
Adventures in time and space
inferredcites →https://doi.org/10.29007/xkwxopenalex-snapshot
Automatic Space Bound Analysis for Functional Programs with Garbage Collection

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-032-22720-1_17openalex-snapshot
The Memorist Tale: Every Thunk Every Cost All At Once
inferred← citeshttps://doi.org/10.1007/978-3-032-22723-2_13openalex-snapshot
Dependently-Typed AARA: A Non-Affine Approach for Resource Analysis of Higher-Order Programs
inferred← citeshttps://doi.org/10.1017/s0956796821000071openalex-snapshot
Relational cost analysis in a functional-imperative setting
inferred← citeshttps://doi.org/10.1017/s095679682200003xopenalex-snapshot
Denotational semantics as a foundation for cost recurrence extraction for functional languages
inferred← citeshttps://doi.org/10.1109/lics56636.2023.10175720openalex-snapshot
Automatic Amortized Resource Analysis with Regular Recursive Types
inferred← citeshttps://doi.org/10.1145/3408979openalex-snapshot
Denotational recurrence extraction for amortized analysis
inferred← citeshttps://doi.org/10.1145/3408992openalex-snapshot
Raising expectations: automating expected cost analysis with types
inferred← citeshttps://doi.org/10.1145/3428225openalex-snapshot
Automatic and efficient variability-aware lifting of functional programs
inferred← citeshttps://doi.org/10.1145/3434308openalex-snapshot
A unifying type-theory for higher-order (amortized) cost analysis
inferred← citeshttps://doi.org/10.1145/3473581openalex-snapshot
Automatic amortized resource analysis with the Quantum physicist’s method
inferred← citeshttps://doi.org/10.1145/3498670openalex-snapshot
A cost-aware logical framework
inferred← citeshttps://doi.org/10.1145/3632852openalex-snapshot
Decalf: A Directed, Effectful Cost-Aware Logical Framework
inferred← citeshttps://doi.org/10.1145/3656380openalex-snapshot
Robust Resource Bounds with Static Analysis and Bayesian Inference
inferred← citeshttps://doi.org/10.1145/3704871openalex-snapshot
Abstract Operational Methods for Call-by-Push-Value
inferred← citeshttps://doi.org/10.1145/3704891openalex-snapshot
Interaction Equivalence
inferred← citeshttps://doi.org/10.1145/3720424openalex-snapshot
Denotational Foundations for Expected Cost Analysis
inferred← citeshttps://doi.org/10.1145/3720492openalex-snapshot
Automatic Linear Resource Bound Analysis for Rust via Prophecy Potentials
inferred← citeshttps://doi.org/10.1145/3763798openalex-snapshot
Integrating Resource Analyses via Resource Decomposition
inferred← citeshttps://doi.org/10.1145/3776657openalex-snapshot
Typing Strictness
inferred← citeshttps://doi.org/10.1145/3776699openalex-snapshot
Domain-Theoretic Semantics for Functional Logic Programming
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.