On the public citation graph

A unifying type-theory for higher-order (amortized) cost analysis

https://doi.org/10.1145/3434308
0 signed · 59 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/978-1-4842-7077-6_3openalex-snapshot
Introduction to Algorithms
inferredcites →https://doi.org/10.1007/978-3-030-17184-1_1openalex-snapshot
Time Credits and Time Receipts in Iris
inferredcites →https://doi.org/10.1007/978-3-642-05089-3_23openalex-snapshot
“Carbon Credits” for Resource-Bounded Computations Using Amortised Analysis
inferredcites →https://doi.org/10.1007/978-3-642-11957-6_16openalex-snapshot
Amortized Resource Analysis with Polynomial Potential
inferredcites →https://doi.org/10.1007/978-3-642-54833-8_19openalex-snapshot
A Core Quantitative Coeffect Calculus
inferredcites →https://doi.org/10.1007/s10817-016-9398-9openalex-snapshot
Type-Based Cost Analysis for Lazy Functional Languages
inferredcites →https://doi.org/10.1007/s10817-017-9431-7openalex-snapshot
Verifying the Correctness and Amortized Complexity of a Union-Find Implementation in Separation Logic with Time Credits
inferredcites →https://doi.org/10.1007/s10990-007-9018-9openalex-snapshot
A call-by-name lambda-calculus machine
inferredcites →https://doi.org/10.1016/0304-3975(92)90386-topenalex-snapshot
Bounded linear logic: a modular approach to polynomial-time computability
inferredcites →https://doi.org/10.1016/0890-5401(91)90052-4openalex-snapshot
Notions of computation and monads
inferredcites →https://doi.org/10.1016/j.tcs.2003.11.020openalex-snapshot
Possible worlds and resources: the semantics of BI
inferredcites →https://doi.org/10.1017/cbo9780511530104openalex-snapshot
Purely Functional Data Structures
inferredcites →https://doi.org/10.1017/s0956796806006216openalex-snapshot
Dependent ML An approach to practical programming with dependent types
inferredcites →https://doi.org/10.1017/s0956796811000165openalex-snapshot
Non-parametric parametricity
inferredcites →https://doi.org/10.1137/0606031openalex-snapshot
Amortized Computational Complexity
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/1706299.1706327openalex-snapshot
Static determination of quantitative resource usage for higher-order programs
inferredcites →https://doi.org/10.1145/1925844.1926427openalex-snapshot
Multivariate amortized resource analysis
inferredcites →https://doi.org/10.1145/1926385.1926427openalex-snapshot
Multivariate amortized resource analysis
inferredcites →https://doi.org/10.1145/2370776.2370792openalex-snapshot
Linear dependent types in a call-by-value scenario
inferredcites →https://doi.org/10.1145/2628136.2628160openalex-snapshot
Coeffects
inferredcites →https://doi.org/10.1145/2737924.2737955openalex-snapshot
Compositional certified resource bounds
inferredcites →https://doi.org/10.1145/2784731.2784749openalex-snapshot
Denotational cost semantics for functional languages with inductive types
inferredcites →https://doi.org/10.1145/2951913.2951939openalex-snapshot
Combining effects and coeffects via grading
inferredcites →https://doi.org/10.1145/3009837.3009842openalex-snapshot
Towards automatic resource bound analysis for OCaml
inferredcites →https://doi.org/10.1145/3009837.3009858openalex-snapshot
Relational cost analysis
inferredcites →https://doi.org/10.1145/3009837.3009874openalex-snapshot
Contract-based resource verification for higher-order functions with memoization
inferredcites →https://doi.org/10.1145/3110287openalex-snapshot
Automating sized-type inference for complexity analysis
inferredcites →https://doi.org/10.1145/325694.325716openalex-snapshot
Resource bound certification
inferredcites →https://doi.org/10.1145/3314221.3314602openalex-snapshot
Resource-guided program synthesis
inferredcites →https://doi.org/10.1145/3371083openalex-snapshot
Recurrence extraction for functional programs through call-by-push-value
inferredcites →https://doi.org/10.1145/3371092openalex-snapshot
Liquidate your assets: reasoning about resource usage in liquid Haskell
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.1515/comp-2018-0009openalex-snapshot
Call-by-need effects via coeffects
inferredcites →https://doi.org/10.2168/lmcs-8(4:11)2012openalex-snapshot
Linear Dependent Types and Relative Completeness
inferredcites →https://doi.org/10.48550/arxiv.1104.0193openalex-snapshot
Linear Dependent Types and Relative Completeness

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-45784-5_5openalex-snapshot
A Reusable Machine-Calculus for Automated Resource Analyses
inferred← citeshttps://doi.org/10.1007/978-3-032-22720-1_15openalex-snapshot
A Category-Theoretic Framework for Dependent Effect Systems
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/s095679682200003xopenalex-snapshot
Denotational semantics as a foundation for cost recurrence extraction for functional languages
inferred← citeshttps://doi.org/10.1017/s0960129521000487openalex-snapshot
Two decades of automatic amortized resource analysis
inferred← citeshttps://doi.org/10.1109/csf64896.2025.00032openalex-snapshot
A Graded Modal Approach to Relaxed Semantic Declassification
inferred← citeshttps://doi.org/10.1109/lics56636.2023.10175720openalex-snapshot
Automatic Amortized Resource Analysis with Regular Recursive Types
inferred← citeshttps://doi.org/10.1145/3473585openalex-snapshot
Reasoning about the garden of forking paths
inferred← citeshttps://doi.org/10.1145/3486169openalex-snapshot
For a Few Dollars More: Verified Fine-Grained Algorithm Analysis Down to LLVM
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/3632918openalex-snapshot
Polynomial Time and Dependent Types
inferred← citeshttps://doi.org/10.1145/3674626openalex-snapshot
Story of Your Lazy Function’s Life: A Bidirectional Demand Semantics for Mechanized Cost Analysis of Lazy Programs
inferred← citeshttps://doi.org/10.1145/3689725openalex-snapshot
A Modal Type Theory of Expected Cost in Higher-Order Probabilistic Programs
inferred← citeshttps://doi.org/10.1145/3689750openalex-snapshot
Effects and Coeffects in Call-by-Push-Value
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.18653/v1/2023.findings-acl.584openalex-snapshot
Human-in-the-loop Abstractive Dialogue Summarization
inferred← citeshttps://doi.org/10.26226/morressier.604907f41a80aac83ca25d21openalex-snapshot
For a Few Dollars More -- Verified Fine-Grained Algorithm Analysis Down to LLVM
inferred← citeshttps://doi.org/10.3390/computers11030045openalex-snapshot
Mind Your Outcomes: The ΔQSD Paradigm for Quality-Centric Systems Development and Its Application to a Blockchain Case Study
inferred← citeshttps://doi.org/10.48550/arxiv.2307.05938openalex-snapshot
Decalf: A Directed, Effectful Cost-Aware Logical Framework
inferred← citeshttps://doi.org/10.70675/3b66e61dz215dz4776z9e3fzb064d9a332dcopenalex-snapshot
Reusable static resource analyses for high level 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.