On the public citation graph
Verifying replicated data types with typeclass refinements in Liquid Haskell
0 signed · 67 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/978-3-030-14805-8_4openalex-snapshot
Proving Type Class Laws for Haskell
inferredcites →https://doi.org/10.1007/978-3-030-44914-8_20openalex-snapshot
Proving the Safety of Highly-Available Distributed Objects
inferredcites →https://doi.org/10.1007/978-3-319-21401-6_26openalex-snapshot
The Lean Theorem Prover (System Description)
inferredcites →https://doi.org/10.1007/978-3-319-41528-4_20openalex-snapshot
Trigger Selection Strategies to Stabilize Program Verifiers
inferredcites →https://doi.org/10.1007/978-3-540-78800-3_24openalex-snapshot
Z3: An Efficient SMT Solver
inferredcites →https://doi.org/10.1007/978-3-642-17511-4_20openalex-snapshot
Dafny: An Automatic Program Verifier for Functional Correctness
inferredcites →https://doi.org/10.1007/978-3-642-24550-3_29openalex-snapshot
Conflict-Free Replicated Data Types
inferredcites →https://doi.org/10.1109/icdcs.2009.20openalex-snapshot
A Commutative Replicated Data Type for Cooperative Editing
inferredcites →https://doi.org/10.1109/icdcs.2009.75openalex-snapshot
Logoot: A Scalable Optimistic Replication Algorithm for Collaborative Editing on P2P Networks
inferredcites →https://doi.org/10.1145/1190315.1190324openalex-snapshot
System F with type equality coercions
inferredcites →https://doi.org/10.1145/128738.128742openalex-snapshot
Lightweight causal and atomic group multicast
inferredcites →https://doi.org/10.1145/1670412openalex-snapshot
Proceedings of the 7th International Workshop on Satisfiability Modulo Theories
inferredcites →https://doi.org/10.1145/2034574.2034796openalex-snapshot
On the bright side of type classes
inferredcites →https://doi.org/10.1145/2034691.2034717openalex-snapshot
Evaluating CRDTs for real-time document editing
inferredcites →https://doi.org/10.1145/2430532.2364522openalex-snapshot
Dependently typed programming with singletons
inferredcites →https://doi.org/10.1145/2737924.2737981openalex-snapshot
Declarative programming over eventually consistent data stores
inferredcites →https://doi.org/10.1145/277650.277732openalex-snapshot
Eliminating array bound checking through dependent types
inferredcites →https://doi.org/10.1145/2837614.2837625openalex-snapshot
'Cause I'm strong enough: Reasoning about consistency choices in distributed systems
inferredcites →https://doi.org/10.1145/2887747.2804303openalex-snapshot
Reasoning with the HERMIT: tool support for equational reasoning on GHC core programs
inferredcites →https://doi.org/10.1145/2933057.2933090openalex-snapshot
Specification and Complexity of Collaborative Text Editing
inferredcites →https://doi.org/10.1145/3122955.3122956openalex-snapshot
Algebraic graphs with class (functional pearl)
inferredcites →https://doi.org/10.1145/3133933openalex-snapshot
Verifying strong eventual consistency in distributed systems
inferredcites →https://doi.org/10.1145/3158141openalex-snapshot
Refinement reflection: complete verification with SMT
inferredcites →https://doi.org/10.1145/3242744.3242756openalex-snapshot
Theorem proving for all: equational reasoning in liquid Haskell (functional pearl)
inferredcites →https://doi.org/10.1145/3290387openalex-snapshot
Hamsaz: replication coordination analysis and synthesis
inferredcites →https://doi.org/10.1145/3290388openalex-snapshot
LWeb: information flow security for multi-tier web applications
inferredcites →https://doi.org/10.1145/3331545.3342591openalex-snapshot
Generic and flexible defaults for verified, law-abiding type-class instances
inferredcites →https://doi.org/10.1145/3341705openalex-snapshot
A role for dependent types in Haskell
inferredcites →https://doi.org/10.1145/359545.359563openalex-snapshot
Time, clocks, and the ordering of events in a distributed system
inferredcites →https://doi.org/10.1145/581690.581691openalex-snapshot
Template meta-programming for Haskell
inferredcites →https://doi.org/10.1145/636517.636528openalex-snapshot
Template meta-programming for Haskell
inferredcites →https://doi.org/10.1145/75277.75283openalex-snapshot
How to make ad-hoc polymorphism less ad hoc
inferredcites →https://doi.org/10.4230/lipics.ecoop.2020.20openalex-snapshot
A Framework for Resource Dependent EDSLs in a Dependently Typed Language (Pearl)
inferredcites →https://doi.org/10.48550/arxiv.1707.01747openalex-snapshot
Verifying Strong Eventual Consistency in Distributed Systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/spe.3430openalex-snapshot
Concurrency Contracts for Designing Highly Available Replicated Data Types
inferred← citeshttps://doi.org/10.1007/978-981-16-8113-4_3openalex-snapshot
Grammatical Evolution Mapping for Semantically-Constrained Genetic Programming
inferred← citeshttps://doi.org/10.1007/s00224-026-10283-wopenalex-snapshot
Cutoff Theorems for the Model Checking of Crash-Tolerant Causal Broadcast
inferred← citeshttps://doi.org/10.1016/j.jpdc.2023.04.008openalex-snapshot
On the correctness of highly available systems in the presence of failures
inferred← citeshttps://doi.org/10.1109/dchpc60845.2024.10454067openalex-snapshot
Modeling and Verification of the Causal Broadcast Algorithm Using Colored Petri Nets
inferred← citeshttps://doi.org/10.1109/icsme64153.2025.00040openalex-snapshot
Trust and Verify: Formally Verified and Upgradable Trusted Functions
inferred← citeshttps://doi.org/10.1145/3519939.3523426openalex-snapshot
Hamband: RDMA replicated data types
inferred← citeshttps://doi.org/10.1145/3519939.3523735openalex-snapshot
Certified mergeable replicated data types
inferred← citeshttps://doi.org/10.1145/3546189.3549919openalex-snapshot
How to safely use extensionality in Liquid Haskell
inferred← citeshttps://doi.org/10.1145/3563336openalex-snapshot
Katara: synthesizing CRDTs with verified lifting
inferred← citeshttps://doi.org/10.1145/3563351openalex-snapshot
Modular verification of op-based CRDTs in separation logic
inferred← citeshttps://doi.org/10.1145/3587216.3587222openalex-snapshot
Verified Causal Broadcast with Liquid Haskell
inferred← citeshttps://doi.org/10.1145/3636501.3636944openalex-snapshot
Rooting for Efficiency: Mechanised Reasoning about Array-Based Trees in Separation Logic
inferred← citeshttps://doi.org/10.1145/3656408openalex-snapshot
Automated Verification of Fundamental Algebraic Laws
inferred← citeshttps://doi.org/10.1145/3720425openalex-snapshot
Hambazi: Spatial Coordination Synthesis for Augmented Reality
inferred← citeshttps://doi.org/10.1145/3720452openalex-snapshot
Automatically Verifying Replication-Aware Linearizability
inferred← citeshttps://doi.org/10.1145/3720502openalex-snapshot
Bolt-On Strong Consistency: Specification, Implementation, and Verification
inferred← citeshttps://doi.org/10.1145/3747528openalex-snapshot
CRDT Emulation, Simulation, and Representation Independence
inferred← citeshttps://doi.org/10.4230/lipics.calco.2025.4openalex-snapshot
Distributive Laws of Monadic Containers
inferred← citeshttps://doi.org/10.48550/arxiv.2110.04461openalex-snapshot
Toward Hole-Driven Development with Liquid Haskell
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.