Alternatives and similar repositories for coq-cds4ltl

Users that are interested in coq-cds4ltl are comparing it to the libraries listed below

• benjaminselfridge / logix
  Logic Explorer - customizable proof construction tool for sequent calculi
  ☆21Updated 3 years ago
• LightAndLight / parametricity-proofs
  Proofs of the number of inhabitants of polymorphic functions
  ☆23Updated 7 years ago
• RyanGlScott / eliminators
  Dependently typed elimination functions using singletons
  ☆28Updated last year
• thoughtpolice / asc
  Austin's supercompiler work
  ☆21Updated 6 years ago
• LightAndLight / cbpv
  A usable type system for call by push-value
  ☆33Updated 6 years ago
• joom / direct-reflection-for-free
  using Data and Typeable to get a direct reflection system for free, when we're implementing a toy language in Haskell
  ☆15Updated 5 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 7 years ago
• MatthewDaggitt / agda-routing
  An Agda library for reasoning about asynchronous iterative algorithms and network routing problems
  ☆28Updated 2 years ago
• konn / equational-reasoning-in-haskell
  Agda-style equational reasoning in Haskell
  ☆54Updated 9 months ago
• Lysxia / profunctor-monad
  Bidirectional programming in Haskell with monadic profunctors
  ☆48Updated 3 years ago
• Jaak / TinyOutsideIn
  Small implementation of OutsideIn(X) type checking algorithm
  ☆31Updated 10 years ago
• LightAndLight / qtt
  Quantitative Type Theory implementation
  ☆54Updated 4 years ago
• amosr / folderol
  machine fusion
  ☆16Updated 7 years ago
• gergoerdi / tandoori
  Compositional type checking for Haskell
  ☆38Updated 14 years ago
• jwiegley / bytestring-fiat
  An implementation of the Haskell ByteString library using the Fiat system from MIT
  ☆34Updated 3 years ago
• DanBurton / system-f
  System F implemented in Haskell
  ☆24Updated 13 years ago
• mstksg / decidable
  Combinators for manipulating dependently-typed predicates.
  ☆14Updated last year
• brunjlar / protop
  topos programming
  ☆31Updated 7 years ago
• gergoerdi / syntactic-stlc
  Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)
  ☆13Updated 8 years ago
• dorchard / effects-as-sessions
  Formalised embedding of an imperative language with effect system into session-typed pi calculus.
  ☆29Updated last year
• yveszhang / ldtyping
  ☆12Updated 9 years ago
• ekmett / name
  nominal sets in haskell
  ☆19Updated 7 years ago
• cocreature / zkboo-hs
  Build Status A Haskell implementation of the ZKBoo protocol for non-interactive zero-knowledge arguments of boolean circuits.
  ☆18Updated 7 years ago
• travitch / haggle
  An efficient graph library for Haskell
  ☆40Updated 4 months ago
• sstucki / pts-agda
  A formalization of Pure Type Systems (PTS) in Agda
  ☆27Updated 6 months ago
• byorgey / enumeration
  Simple Haskell package for efficiently indexable finite and infinite enumerations.
  ☆12Updated 8 months ago
• nobrakal / tungsten
  Bring fusion to everyone
  ☆14Updated 5 years ago
• ayberkt / Mini-TT
  A tiny implementation of dependent types.
  ☆11Updated 8 years ago
• dalaing / type-systems
  ☆23Updated 8 years ago
• bgamari / the-thoralf-plugin
  This a type-checker plugin to rule all type checker plugins involving type-equality reasoning using smt solvers.
  ☆21Updated 3 years ago