Alternatives and similar repositories for prologish:

Users that are interested in prologish are comparing it to the libraries listed below

• robrix / sequoia
  classical sequent calculus, embedded in Haskell
  ☆19Updated 3 years ago
• andorp / mini-grin
  ICFP tutorial
  ☆39Updated 3 years ago
• sjoerdvisscher / proarrow
  Haskell library for doing category theory with a central role for profunctors
  ☆21Updated last week
• LightAndLight / cbpv
  A usable type system for call by push-value
  ☆33Updated 5 years ago
• haskellari / some
  Existential type.
  ☆37Updated 2 months ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆39Updated 4 years ago
• TheMatten / hask
  Funny little Haskell impl
  ☆18Updated 4 years ago
• nachivpn / nbe-course
  NbE course @ Chalmers
  ☆28Updated 5 months ago
• gallais / potpourri
  Where my everyday research happens
  ☆52Updated this week
• wrengr / unification-fd
  Generic functions for single-sorted first-order structural unification
  ☆42Updated last week
• pigworker / Samizdat
  being bits and pieces I'm inclined to leave lying around
  ☆49Updated 3 months ago
• sweirich / lennart-lambda
  λλλλ Lennart Augustsson's λ-calculus cooked four ways
  ☆29Updated 3 years ago
• TOTBWF / tactic-haskell
  Tactic Metaprogramming in Haskell
  ☆56Updated 5 years ago
• effectfully / Generic
  A library for doing generic programming in Agda
  ☆31Updated 4 years ago
• sheaf / if-instance
  GHC plugin to branch on whether a constraint is satisfied
  ☆33Updated 3 months ago
• bjpop / ministg
  Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.
  ☆72Updated 5 years ago
• LightAndLight / sage
  Efficient parser combinators for Haskell
  ☆39Updated 10 months ago
• well-typed / recover-rtti
  Recover run-time type information from the GHC heap. One example use case is a "show anything" function (with no Show constraint).
  ☆35Updated last month
• phadej / overloaded
  Overloaded plugin
  ☆30Updated 8 months ago
• TOTBWF / refinery
  ⛏️ A refinement proof framework for haskell
  ☆69Updated last year
• TOTBWF / cubical-categories
  Category theory formalized in cubical agda
  ☆20Updated 5 years ago
• AndrasKovacs / 2ltt-impl
  Eventually a practical 2-level TT-based compiler
  ☆27Updated 3 weeks ago
• ekmett / parsnip
  ☆18Updated 3 years ago
• konn / equational-reasoning-in-haskell
  Agda-style equational reasoning in Haskell
  ☆52Updated 2 months ago
• matt-noonan / gdp
  Ghosts of Departed Proofs
  ☆60Updated 4 years ago
• fumieval / oath
  Composable Concurrent Computation Done Right
  ☆30Updated 2 years ago
• discus-lang / salt
  The compilation target that functional programmers always wanted.
  ☆62Updated 4 years ago
• jespercockx / agda2scheme
  Compiler backend for generating Scheme code
  ☆27Updated last year
• pigworker / ProgrammerCommaCon
  being a collection of Agda-facilitated ramblings
  ☆33Updated 4 years ago