Alternatives and similar repositories for SeqDecProbs:

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

• pigworker / ProgrammerCommaCon
  being a collection of Agda-facilitated ramblings
  ☆33Updated 4 years ago
• GaloisInc / lean-haskell-bindings
  Haskell Bindings to the Lean Theorem Prover http://leanprover.github.io/
  ☆21Updated 7 years ago
• laurmcarter / type-combinators
  Type level lists, pairs, sums, their operations, and their properties.
  ☆24Updated 6 years ago
• Saizan / cubical-demo
  ☆45Updated 5 years ago
• mortberg / AlgTop
  Haskell library of algebraic topology
  ☆23Updated 13 years ago
• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆24Updated 10 years ago
• pigworker / Bi71
  being a bidirectional reformulation of Martin-Löf's 1971 type theory
  ☆25Updated 7 years ago
• konn / equational-reasoning-in-haskell
  Agda-style equational reasoning in Haskell
  ☆52Updated 2 months ago
• mstksg / uncertain
  Manipulating numbers with inherent measurement/experimental uncertainty.
  ☆25Updated 6 months ago
• pigworker / Pivotal
  ☆30Updated 10 years ago
• jwiegley / z3cat
  Use Conal Elliott's concat library to compile regular Haskell functions into Z3 equations
  ☆38Updated 7 years ago
• osa1 / StrictCore
  An experimental intermediate language for GHC
  ☆36Updated 7 years ago
• LeventErkok / sbvPlugin
  Formally prove properties of Haskell programs using SBV/SMT.
  ☆45Updated 9 months ago
• lthms / chain
  Extensible, Type Safe Error Handling in Haskell
  ☆13Updated 4 years ago
• emilaxelsson / imperative-edsl
  Deep embedding of imperative programs with code generation
  ☆23Updated 2 years ago
• pbl64k / gpif-idris
  Translation of Agda code in A. Löh and J. P. Magalhães *Generic Programming with Indexed Functors* to Idris.
  ☆14Updated 7 years ago
• ecaustin / haskhol-core
  The core logical system of the HaskHOL theorem prover. See haskhol.org for more details.
  ☆2Updated 8 years ago
• byorgey / enumeration
  Simple Haskell package for efficiently indexable finite and infinite enumerations.
  ☆12Updated last week
• stepcut / idrOS
  An OS written in Idris (eventually...)
  ☆19Updated 10 years ago
• dorchard / effects-as-sessions
  Formalised embedding of an imperative language with effect system into session-typed pi calculus.
  ☆28Updated 3 months ago
• Saizan / parametric-demo
  ☆12Updated 5 years ago
• jpaykin / LNLHaskell
  Adding linear types to Haskell in the style of Linear/Non-Linear (LNL) logic
  ☆35Updated 6 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆29Updated 6 years ago
• agda / ooAgda
  Interactive and object-oriented programming in Agda using coinductive types
  ☆23Updated 3 months ago
• jwiegley / bytestring-fiat
  An implementation of the Haskell ByteString library using the Fiat system from MIT
  ☆32Updated 2 years ago
• effectfully / OTT
  Observational Type Theory as an Agda library
  ☆52Updated 7 years ago
• pcapriotti / agda-categories
  Category theory and algebra
  ☆28Updated 8 years ago
• Lysxia / profunctor-monad
  Bidirectional programming in Haskell with monadic profunctors
  ☆46Updated 2 years ago
• SamuelSchlesinger / gaia
  An experiment in functional interface design
  ☆23Updated 8 years ago
• byorgey / type-matrices
  Paper about polynomial functors, regular expressions, matrices of types, derivatives, semirings, and other cool stuff
  ☆13Updated 7 years ago