ucsd-progsys / liquid-fixpointView external linksLinks
Horn Clause Constraint Solving for Liquid Types
☆157Updated this week
Alternatives and similar repositories for liquid-fixpoint
Users that are interested in liquid-fixpoint are comparing it to the libraries listed below
Sorting:
- Liquid Types For Haskell☆1,288Updated this week
- Extensible, Type Safe Error Handling in Haskell☆13Dec 22, 2020Updated 5 years ago
- ☆16Feb 18, 2025Updated 11 months ago
- An tutorial-style implementation of liquid/refinement types for a subset of Ocaml/Reason.☆150Sep 23, 2025Updated 4 months ago
- Alternative implementation of the logical framework Dedukti in Rust☆23Apr 10, 2025Updated 10 months ago
- Interpreter for functional pure type systems.☆21Jun 30, 2017Updated 8 years ago
- Haskell space profiling toolset☆14Nov 7, 2018Updated 7 years ago
- Label dependent dependent session types☆16May 2, 2024Updated last year
- quotient types in cubical Agda☆24Feb 4, 2019Updated 7 years ago
- van Laarhoven lenses for Idris☆20Sep 25, 2017Updated 8 years ago
- CoqHammer: An Automated Reasoning Hammer Tool for Rocq - Proof Automation for Dependent Type Theory☆237Dec 2, 2025Updated 2 months ago
- Standard library for linear types in Haskell.☆352Jan 27, 2026Updated 2 weeks ago
- Demo for dependent types + runtime code generation☆72Feb 18, 2025Updated 11 months ago
- Diffing of (expression) trees.☆79Jul 9, 2025Updated 7 months ago
- A simple λProlog interpreter☆20Nov 29, 2021Updated 4 years ago
- Inline, type safe X86-64 assembly programming in Agda☆69Jan 3, 2019Updated 7 years ago
- A non-interactive proof assistant using the Haskell type system☆38Apr 11, 2020Updated 5 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆86Sep 13, 2021Updated 4 years ago
- A verified Implementation of a mini prolog☆17Nov 27, 2022Updated 3 years ago
- Proof combinators used in Liquid Haskell for theorem proving☆12Mar 28, 2018Updated 7 years ago
- [wip] Proof format and checker for first-order and higher-order theorem provers☆12Mar 29, 2023Updated 2 years ago
- Fake dependent types in Haskell using singletons☆293Jan 11, 2026Updated last month
- Strongly-typed System F in Haskell☆120Oct 18, 2022Updated 3 years ago
- higher order dependently typed logic programing☆173Aug 7, 2018Updated 7 years ago
- Dependently-typed finite maps (partial dependent products)☆67Oct 19, 2025Updated 3 months ago
- A Seamless, Interactive Tactic Learner and Prover for Coq☆82Updated this week
- A package re-exporting the verified subset of containers☆20Jun 18, 2018Updated 7 years ago
- Formal Semantics for Why3☆19Sep 28, 2025Updated 4 months ago
- Handling errors which occur deep inside lens-chains☆17Jul 4, 2019Updated 6 years ago
- A small implementation of higher-order unification☆192Aug 6, 2017Updated 8 years ago
- Optics as an abstract interface☆387Updated this week
- Metaprogramming, verified meta-theory and implementation of Rocq in Rocq☆504Feb 6, 2026Updated last week
- Proof assistant based on the λΠ-calculus modulo rewriting☆372Updated this week
- an experiment in presenting code.☆14Aug 11, 2020Updated 5 years ago
- Type Safe LLVM IR ( Experimental )☆49Jun 13, 2018Updated 7 years ago
- Symbolic formula representation and solver interaction library☆174Updated this week
- Tiny verified SAT-solver☆30Jan 7, 2022Updated 4 years ago
- A magic typeclass that just does it☆126Aug 1, 2022Updated 3 years ago
- Efficient Haskell effect handlers based on evidence translation.☆86Jul 19, 2021Updated 4 years ago