On the public citation graph
Equations reloaded: high-level dependently-typed functional programming and proving in Coq
0 signed · 75 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/11617990_12openalex-snapshot
A Few Constructions on Constructors
inferredcites →https://doi.org/10.1007/11737414_9openalex-snapshot
Defining and Reasoning About Recursive Functions: A Practical Tool for the Coq Proof Assistant
inferredcites →https://doi.org/10.1007/11814771_48openalex-snapshot
Partial Recursive Functions in Higher-Order Logic
inferredcites →https://doi.org/10.1007/11874683_5openalex-snapshot
Semi-continuous Sized Types and Termination
inferredcites →https://doi.org/10.1007/978-3-642-14052-5_29openalex-snapshot
Equations: A Dependent Pattern-Matching Compiler
inferredcites →https://doi.org/10.1007/978-3-642-32347-8_17openalex-snapshot
Stop When You Are Almost-Full
inferredcites →https://doi.org/10.1007/978-3-642-39634-2_25openalex-snapshot
Handcrafted Inversions Made Operational on Operational Semantics
inferredcites →https://doi.org/10.1016/s0747-7171(86)80002-5openalex-snapshot
Constructing recursion operators in intuitionistic type theory
inferredcites →https://doi.org/10.1017/s0956796816000022openalex-snapshot
Well-founded recursion with copatterns and sized types
inferredcites →https://doi.org/10.1017/s095679681800014xopenalex-snapshot
Proof-relevant unification: Dependent pattern matching with only the axioms of your type theory
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/lics.1994.316071openalex-snapshot
The groupoid model refutes uniqueness of identity proofs
inferredcites →https://doi.org/10.1145/1291151.1291156openalex-snapshot
Program-ing finger trees in C oq
inferredcites →https://doi.org/10.1145/237721.240882openalex-snapshot
Proving the correctness of reactive systems using sized types
inferredcites →https://doi.org/10.1145/3018610.3018612openalex-snapshot
Lifting proof-relevant unification to higher dimensions
inferredcites →https://doi.org/10.1145/3110277openalex-snapshot
Normalization by evaluation for sized dependent types
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/3158104openalex-snapshot
Intrinsically-typed definitional interpreters for imperative languages
inferredcites →https://doi.org/10.1145/3236770openalex-snapshot
Elaborating dependent (co)pattern matching
inferredcites →https://doi.org/10.1145/3290316openalex-snapshot
Definitional proof-irrelevance without K
inferredcites →https://doi.org/10.1145/3341690openalex-snapshot
Equations reloaded: high-level dependently-typed functional programming and proving in Coq
inferredcites →https://doi.org/10.1145/3342526openalex-snapshot
Equations Reloaded Accompanying Material
inferredcites →https://doi.org/10.4204/eptcs.185.5openalex-snapshot
Equations for Hereditary Substitution in Leivant's Predicative System F: A Case Study
inferredcites →https://doi.org/10.4230/lipics.itcs.2018.56openalex-snapshot
A Homological Theory of Functions: Nonuniform Boolean Complexity Separation and VC Dimension Bound Via Algebraic Topology, and a Homological Farkas Lemma
inferredcites →https://doi.org/10.7551/mitpress/9153.001.0001openalex-snapshot
Certified Programming with Dependent Types
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-36755-8_4openalex-snapshot
Completeness Theorems for First-Order Logic Analysed in Constructive Type Theory
inferred← citeshttps://doi.org/10.1007/978-3-031-16912-0_6openalex-snapshot
Towards a Practical Library for Monadic Equational Reasoning in Coq
inferred← citeshttps://doi.org/10.1007/978-3-031-29082-4_3openalex-snapshot
Curiously Empty Intersection of Proof Engineering and Computational Sciences
inferred← citeshttps://doi.org/10.1007/978-3-031-30044-8_5openalex-snapshot
Builtin Types Viewed as Inductive Families
inferred← citeshttps://doi.org/10.1007/978-3-031-91118-7_8openalex-snapshot
Artifact Report: an Abstract, Certified Account of Operational Game Semantics
inferred← citeshttps://doi.org/10.1007/s10817-025-09726-9openalex-snapshot
A Sound and Complete Projection for Global Types
inferred← citeshttps://doi.org/10.1017/s0956796822000077openalex-snapshot
Extracting functional programs from Coq, in Coq
inferred← citeshttps://doi.org/10.1017/s0956796822000107openalex-snapshot
Fold–unfold lemmas for reasoning about recursive programs using the Coq proof assistant
inferred← citeshttps://doi.org/10.1017/s0956796824000157openalex-snapshot
A practical formalization of monadic equational reasoning in dependent-type theory
inferred← citeshttps://doi.org/10.1017/s0956796825100105openalex-snapshot
Choice trees: Representing and reasoning about nondeterministic, recursive, and impure programs in Rocq
inferred← citeshttps://doi.org/10.1093/logcom/exaa073openalex-snapshot
Completeness theorems for first-order logic analysed in constructive type theory
inferred← citeshttps://doi.org/10.1109/access.2021.3128382openalex-snapshot
An Abstract Machine Approach to Preserving Digital Information
inferred← citeshttps://doi.org/10.1109/csf51468.2021.00042openalex-snapshot
Formalizing Nakamoto-Style Proof of Stake
inferred← citeshttps://doi.org/10.1142/9789811236488_0008openalex-snapshot
The Braga Method: Extracting Certified Algorithms from Complex Recursive Schemes in Coq
inferred← citeshttps://doi.org/10.1145/3371076openalex-snapshot
Coq Coq correct! verification of type checking and erasure for Coq, in Coq
inferred← citeshttps://doi.org/10.1145/3372885.3373817openalex-snapshot
Coq à la carte: a practical approach to modular syntax with binders
inferred← citeshttps://doi.org/10.1145/3372885.3373822openalex-snapshot
A mechanized formalization of GraphQL
inferred← citeshttps://doi.org/10.1145/3372885.3373832openalex-snapshot
Undecidability of higher-order unification formalised in Coq
inferred← citeshttps://doi.org/10.1145/3385412.3385992openalex-snapshot
Zippy LL(1) parsing with derivatives
inferred← citeshttps://doi.org/10.1145/3408989openalex-snapshot
Lower your guards: a compositional pattern-match coverage checker
inferred← citeshttps://doi.org/10.1145/3437992.3439934openalex-snapshot
Extracting smart contracts tested and verified in Coq
inferred← citeshttps://doi.org/10.1145/3519939.3523715openalex-snapshot
Leapfrog: certified equivalence for protocol parsers
inferred← citeshttps://doi.org/10.1145/3547628openalex-snapshot
Verified symbolic execution with Kripke specification monads (and no meta-programming)
inferred← citeshttps://doi.org/10.1145/3571196openalex-snapshot
A Type-Based Approach to Divide-and-Conquer Recursion in Coq
inferred← citeshttps://doi.org/10.1145/3573105.3575683openalex-snapshot
Practical and Sound Equality Tests, Automatically: Deriving eqType Instances for Jasmin’s Data Types with Coq-Elpi
inferred← citeshttps://doi.org/10.1145/3573105.3575690openalex-snapshot
A Computational Cantor-Bernstein and Myhill’s Isomorphism Theorem in Constructive Type Theory (Proof Pearl)
inferred← citeshttps://doi.org/10.1145/3706056openalex-snapshot
Correct and Complete Type Checking and Certified Erasure for Coq , in Coq
inferred← citeshttps://doi.org/10.1145/3747511openalex-snapshot
McTT: A Verified Kernel for a Proof Assistant
inferred← citeshttps://doi.org/10.1145/3779031.3779091openalex-snapshot
A Rose Tree Is Blooming (Proof Pearl)
inferred← citeshttps://doi.org/10.1145/3798248openalex-snapshot
PLEX: Normalization for Refinement Types
inferred← citeshttps://doi.org/10.1145/3838790.3838795openalex-snapshot
Programs and Proofs in Practice
inferred← citeshttps://doi.org/10.15514/ispras-2021-33(3)-11openalex-snapshot
Mechanized Theory of Event Structures: A Case of Parallel Register Machine
inferred← citeshttps://doi.org/10.29007/92jtopenalex-snapshot
Efficient and Verified Continuous Double Auctions
inferred← citeshttps://doi.org/10.4204/eptcs.369.2openalex-snapshot
Mechanizing Matching Logic In Coq
inferred← citeshttps://doi.org/10.4230/lipics.itp.2021.28openalex-snapshot
Verified Double Sided Auctions for Financial Markets
inferred← citeshttps://doi.org/10.46298/lmcs-18(1:35)2022openalex-snapshot
Hilbert's Tenth Problem in Coq (Extended Version)
inferred← citeshttps://doi.org/10.48550/arxiv.2006.15135openalex-snapshot
Generating induction principles and subterm relations for inductive types using MetaCoq
inferred← citeshttps://doi.org/10.70675/0a3f5dbaza45az464dz8686z8c853cf21497openalex-snapshot
Prétraitement compositionnel en Coq
inferred← citeshttps://doi.org/10.70675/adcfd403z5566z460dz9591zebb0e4f5a766openalex-snapshot
Principles of program verification for arbitrary monadic effects
inferred← citeshttps://doi.org/10.70675/f3c96514z4373z4f99z8b3fzb1b41307d558openalex-snapshot
Formalisation et Méta-Théorie de la Théorie des Types
showing the first 44 of 45 · page through all 45
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.