On the public citation graph
Ready, set, verify! applying hs-to-coq to real-world Haskell code (experience report)
0 signed · 44 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/11814771_48openalex-snapshot
Partial Recursive Functions in Higher-Order Logic
inferredcites →https://doi.org/10.1007/3-540-45949-9openalex-snapshot
Isabelle/HOL: A Proof Assistant for Higher-Order Logic
inferredcites →https://doi.org/10.1007/978-3-642-03359-9_6openalex-snapshot
A Brief Overview of Agda – A Functional Language with Dependent Types
inferredcites →https://doi.org/10.1007/978-3-642-14052-5_15openalex-snapshot
The Optimal Fixed Point Combinator
inferredcites →https://doi.org/10.1007/978-3-642-37036-6_13openalex-snapshot
Abstract Refinement Types
inferredcites →https://doi.org/10.1016/s0167-6423(99)00002-7openalex-snapshot
Purely functional data structures
inferredcites →https://doi.org/10.1017/cbo9780511530104openalex-snapshot
Purely Functional Data Structures
inferredcites →https://doi.org/10.1017/s0956796811000104openalex-snapshot
Balancing weight-balanced trees
inferredcites →https://doi.org/10.1098/rsta.2016.0331openalex-snapshot
Position paper: the science of deep specification
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1145/1111037.1111056openalex-snapshot
Fast and loose reasoning is morally correct
inferredcites →https://doi.org/10.1145/1863523.1863526openalex-snapshot
The performance of the Haskell containers package
inferredcites →https://doi.org/10.1145/3122955.3122963openalex-snapshot
A tale of two provers: verifying monoidal string matching in liquid Haskell and Coq
inferredcites →https://doi.org/10.1145/3158141openalex-snapshot
Refinement reflection: complete verification with SMT
inferredcites →https://doi.org/10.1145/321479.321481openalex-snapshot
PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric
inferredcites →https://doi.org/10.1145/3236784openalex-snapshot
Ready, set, verify! applying hs-to-coq to real-world Haskell code (experience report)
inferredcites →https://doi.org/10.1145/800152.804906openalex-snapshot
Binary search trees of bounded balance
inferredcites →https://doi.org/10.48550/arxiv.1803.06960openalex-snapshot
Ready, Set, Verify! Applying hs-to-coq to real-world Haskell code
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-030-99461-7_6openalex-snapshot
Translation Certification for Smart Contracts
inferred← citeshttps://doi.org/10.1007/978-3-031-33170-1_20openalex-snapshot
Formalized High Level Synthesis with Applications to Cryptographic Hardware
inferred← citeshttps://doi.org/10.1007/978-3-031-57267-8openalex-snapshot
Programming Languages and Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-57267-8_11openalex-snapshot
Verified Inlining and Specialisation for PureCake
inferred← citeshttps://doi.org/10.1017/s0956796825100099openalex-snapshot
Checking equivalence in a non-strict language
inferred← citeshttps://doi.org/10.1145/3331545.3342591openalex-snapshot
Generic and flexible defaults for verified, law-abiding type-class instances
inferred← citeshttps://doi.org/10.1145/3377555.3377884openalex-snapshot
Postcondition-preserving fusion of postorder tree transformations
inferred← citeshttps://doi.org/10.1145/3453483.3454065openalex-snapshot
Integration verification across software and hardware for a simple embedded system
inferred← citeshttps://doi.org/10.1145/3473578openalex-snapshot
Reasoning about effect interaction by fusion
inferred← citeshttps://doi.org/10.1145/3519939.3523728openalex-snapshot
Quickstrom: property-based acceptance testing with LTL specifications
inferred← citeshttps://doi.org/10.1145/3546189.3549920openalex-snapshot
Reasonable Agda is correct Haskell: writing verified Haskell using agda2hs
inferred← citeshttps://doi.org/10.1145/3563340openalex-snapshot
Checking equivalence in a non-strict language
inferred← citeshttps://doi.org/10.1145/3573105.3575685openalex-snapshot
Formalising Decentralised Exchanges in Coq
inferred← citeshttps://doi.org/10.1145/3591259openalex-snapshot
PureCake: A Verified Compiler for a Lazy Functional Language
inferred← citeshttps://doi.org/10.1145/3607833openalex-snapshot
Flexible Instruction-Set Semantics via Abstract Monads (Experience Report)
inferred← citeshttps://doi.org/10.1145/3759538.3759652openalex-snapshot
Representing Data Structures with Invariants in Haskell: The Cases of BST and AVL
inferred← citeshttps://doi.org/10.22152/programming-journal.org/2019/3/8openalex-snapshot
One Monad to Prove Them All
inferred← citeshttps://doi.org/10.48550/arxiv.1910.11724openalex-snapshot
Embracing a mechanized formalization gap
inferred← citeshttps://doi.org/10.48550/arxiv.2006.01531openalex-snapshot
Effectful Programming in Declarative Languages with an Emphasis on Non-Determinism: Applications and Formal Reasoning
inferred← citeshttps://doi.org/10.70675/ab81fcc8z8a9dz4164zbffdz9dd6b541d938openalex-snapshot
Tools and Techniques for the Verification of Modular Stateful Code
showing the first 21 of 22 · page through all 22
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.