Alternatives and similar repositories for liquid-fixpoint

Users that are interested in liquid-fixpoint are comparing it to the libraries listed below

• gallais / agdarsec
  Total Parser Combinators in Agda
  ☆132Updated last month
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆111Updated last month
• msp-strath / TypOS
  being an operating system for typechecking processes
  ☆128Updated 2 years ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• edwinb / SPLV20
  SPLV20 course notes
  ☆112Updated 2 years ago
• scmu / aopa
  Algebra of Programming in Agda: Dependent Types for Relational Program Derivation
  ☆83Updated 9 years ago
• TyGuS / hoogle_plus
  Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)
  ☆61Updated last month
• edwinb / Yaffle
  A core language and API for dependently typed languages
  ☆97Updated 6 months ago
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆119Updated 3 months ago
• plclub / hs-to-coq
  Convert Haskell source code to Coq source code.
  ☆87Updated 2 months ago
• jozefg / nbe-for-mltt
  Normalization by Evaluation for Martin-Löf Type Theory
  ☆129Updated last year
• alhassy / next-700-module-systems
  PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.
  ☆82Updated 3 years ago
• gallais / idris-tparsec
  TParsec - Total Parser Combinators in Idris
  ☆95Updated 2 years ago
• agda / agda-language-server
  Language Server for Agda
  ☆114Updated 3 weeks ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆115Updated 5 years ago
• IagoAbal / haskell-z3
  Haskell bindings to Microsoft's Z3 API (unofficial).
  ☆62Updated last year
• wenkokke / schmitty
  Agda bindings to SMT-LIB2 compatible solvers.
  ☆102Updated last month
• HoTT-Intro / Agda
  Agda formalisation of the Introduction to Homotopy Type Theory
  ☆125Updated 3 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆83Updated 4 years ago
• RedPRL / redtt
  "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory
  ☆210Updated 3 years ago
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆76Updated 3 weeks ago
• sweirich / challenge
  Strongly-typed System F in Haskell
  ☆118Updated 2 years ago
• jozefg / higher-order-unification
  A small implementation of higher-order unification
  ☆190Updated 8 years ago
• mortberg / yacctt
  yacctt: Yet Another Cartesian Cubical Type Theory
  ☆75Updated 7 years ago
• abella-prover / abella
  An interactive theorem prover based on lambda-tree syntax
  ☆96Updated 3 months ago
• gibbon-compiler / gibbon
  A compiler for functional programs on serialized data
  ☆167Updated this week
• xnning / EvEff
  Efficient Haskell effect handlers based on evidence translation.
  ☆84Updated 4 years ago
• agda / agda2hs
  Compiling Agda code to readable Haskell
  ☆192Updated last week
• UlfNorell / agda-prelude
  Programming library for Agda
  ☆130Updated last year
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆60Updated last year