On the public citation graph

Reasoning about the garden of forking paths

0 signed · 52 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-39185-1_17openalex-snapshot

Monad Translating Inductive and Coinductive Types

inferredcites →https://doi.org/10.1007/978-3-319-89884-1_19openalex-snapshot

A Fistful of Dollars: Formalizing Asymptotic Complexity Claims via Deductive Program Verification

inferredcites →https://doi.org/10.1007/978-3-642-03359-9_30openalex-snapshot

A Hoare Logic for the State Monad

inferredcites →https://doi.org/10.1007/978-3-642-18378-2_14openalex-snapshot

Sloth – A Tool for Checking Minimal-Strictness

inferredcites →https://doi.org/10.1007/978-3-642-24690-6_12openalex-snapshot

Reverse Hoare Logic

inferredcites →https://doi.org/10.1007/978-3-642-31485-8_3openalex-snapshot

A Short Introduction to Implicit Computational Complexity

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.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/0304-3975(89)90122-9openalex-snapshot

The semantics of lazy functional languages

inferredcites →https://doi.org/10.1016/0890-5401(91)90052-4openalex-snapshot

Notions of computation and monads

inferredcites →https://doi.org/10.1016/s1571-0661(04)00022-2openalex-snapshot

Call-by-name, Call-by-value, Call-by-need, and the Linear Lambda Calculus

inferredcites →https://doi.org/10.1017/s0956796808006953openalex-snapshot

Hoare type theory, polymorphism and separation

inferredcites →https://doi.org/10.1017/s0956796820000283openalex-snapshot

Ready, Set , Verify! Applying hs-to-coq to real-world Haskell code

inferredcites →https://doi.org/10.1017/s0960129500001560openalex-snapshot

Comprehending monads

inferredcites →https://doi.org/10.1093/comjnl/32.2.98openalex-snapshot

Why Functional Programming Matters

inferredcites →https://doi.org/10.1137/0205037openalex-snapshot

Data Types as Lattices

inferredcites →https://doi.org/10.1145/1088348.1088355openalex-snapshot

Verifying haskell programs using constructive type theory

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/141471.141563openalex-snapshot

Reasoning about programs in continuation-passing style.

inferredcites →https://doi.org/10.1145/158511.158618openalex-snapshot

A natural semantics for lazy evaluation

inferredcites →https://doi.org/10.1145/199448.199528openalex-snapshot

Monad transformers and modular interpreters

inferredcites →https://doi.org/10.1145/2003476.2003487openalex-snapshot

Minimally strict polymorphic functions

inferredcites →https://doi.org/10.1145/2362389.2362393openalex-snapshot

Multivariate amortized resource analysis

inferredcites →https://doi.org/10.1145/2491956.2491978openalex-snapshot

Verifying higher-order programs with the dijkstra monad

inferredcites →https://doi.org/10.1145/292540.292547openalex-snapshot

Improvement in a lazy context

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/3133903openalex-snapshot

TiML: a functional language for practical complexity analysis with invariants

inferredcites →https://doi.org/10.1145/3167092openalex-snapshot

Total Haskell is reasonable Coq

inferredcites →https://doi.org/10.1145/3236797openalex-snapshot

Keep your laziness in check

inferredcites →https://doi.org/10.1145/325694.325716openalex-snapshot

Resource bound certification

inferredcites →https://doi.org/10.1145/3341707openalex-snapshot

A predicate transformer semantics for effects (functional pearl)

inferredcites →https://doi.org/10.1145/3341708openalex-snapshot

Dijkstra monads for all

inferredcites →https://doi.org/10.1145/3341718openalex-snapshot

Call-by-need is clairvoyant call-by-value

inferredcites →https://doi.org/10.1145/3371078openalex-snapshot

Incorrectness logic

inferredcites →https://doi.org/10.1145/3371092openalex-snapshot

Liquidate your assets: reasoning about resource usage in liquid Haskell

inferredcites →https://doi.org/10.1145/3408979openalex-snapshot

Denotational recurrence extraction for amortized analysis

inferredcites →https://doi.org/10.1145/3434308openalex-snapshot

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

inferredcites →https://doi.org/10.1145/360933.360975openalex-snapshot

Guarded commands, nondeterminacy and formal derivation of programs

inferredcites →https://doi.org/10.1145/363235.363259openalex-snapshot

An axiomatic basis for computer programming

inferredcites →https://doi.org/10.1145/800168.811543openalex-snapshot

A lazy evaluator

inferredcites →https://doi.org/10.22152/programming-journal.org/2019/3/8openalex-snapshot

One Monad to Prove Them All

inferredcites →https://doi.org/10.3217/jucs-010-07-0751openalex-snapshot

Total Functional Programming

inferredcites →https://doi.org/10.4204/eptcs.76.7openalex-snapshot

Evaluation strategies for monadic computations

inferredcites →https://doi.org/10.5281/zenodo.4771437openalex-snapshot

Reasoning about the garden of forking paths (artifact)

What points at this work

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

inferred← backgroundhttps://doi.org/10.5281/zenodo.5154097zenodo-depositor-declared

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-981-92-0184-6_5openalex-snapshot

Unifying Hindsight and Foresight

inferred← citeshttps://doi.org/10.1145/3591259openalex-snapshot

PureCake: A Verified Compiler for a Lazy Functional Language

inferred← citeshttps://doi.org/10.1145/3632892openalex-snapshot

Thunks and Debits in Separation Logic with Time Credits

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/3677999.3678282openalex-snapshot

Liquid Amortization: Proving Amortized Complexity with LiquidHaskell (Functional Pearl)

inferred← citeshttps://doi.org/10.1145/3759164.3759351openalex-snapshot

Lightweight Testing of Persistent Amortized Time Complexity in the Credit Monad

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.