nicolabotta / SeqDecProbs

Related projects ⓘ

Alternatives and complementary repositories for SeqDecProbs

• pigworker / ProgrammerCommaCon
  being a collection of Agda-facilitated ramblings
  ☆33Updated 4 years ago
• effectfully / OTT
  Observational Type Theory as an Agda library
  ☆50Updated 7 years ago
• thsutton / cha
  A port of miniprl to Haskell with co-/inductive types bolted on the side.
  ☆22Updated 8 years ago
• byorgey / enumeration
  Simple Haskell package for efficiently indexable finite and infinite enumerations.
  ☆11Updated 3 years ago
• benjaminselfridge / logix
  Logic Explorer - customizable proof construction tool for sequent calculi
  ☆20Updated 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
• jwiegley / bytestring-fiat
  An implementation of the Haskell ByteString library using the Fiat system from MIT
  ☆31Updated 2 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆29Updated 5 years ago
• osa1 / StrictCore
  An experimental intermediate language for GHC
  ☆37Updated 7 years ago
• jpaykin / LNLHaskell
  Adding linear types to Haskell in the style of Linear/Non-Linear (LNL) logic
  ☆35Updated 6 years ago
• stepcut / idrOS
  An OS written in Idris (eventually...)
  ☆18Updated 9 years ago
• LeventErkok / sbvPlugin
  Formally prove properties of Haskell programs using SBV/SMT.
  ☆44Updated 5 months ago
• twanvl / ttie
  Type Theory with Indexed Equality
  ☆23Updated 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
• pigworker / Bi71
  being a bidirectional reformulation of Martin-Löf's 1971 type theory
  ☆25Updated 7 years ago
• DanBurton / system-f
  System F implemented in Haskell
  ☆24Updated 12 years ago
• laurmcarter / type-combinators
  Type level lists, pairs, sums, their operations, and their properties.
  ☆24Updated 6 years ago
• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆24Updated 9 years ago
• GaloisInc / lean-haskell-bindings
  Haskell Bindings to the Lean Theorem Prover http://leanprover.github.io/
  ☆21Updated 7 years ago
• cedille / cedille-developments
  A showcase of interesting code and proof developments in Cedille
  ☆36Updated last year
• wenkokke / msla2014
  wherein I implement several substructural logics in Agda
  ☆24Updated 6 years ago
• byorgey / type-matrices
  Paper about polynomial functors, regular expressions, matrices of types, derivatives, semirings, and other cool stuff
  ☆13Updated 6 years ago
• jwiegley / linearscan
  ☆17Updated 2 years ago
• Lysxia / profunctor-monad
  Bidirectional programming in Haskell with monadic profunctors
  ☆44Updated 2 years ago
• phadej / kleene
  Kleene algebra, regular expressions
  ☆32Updated 11 months ago
• mstksg / uncertain
  Manipulating numbers with inherent measurement/experimental uncertainty.
  ☆25Updated last month
• heades / System-F-Coq
  System F in coq.
  ☆19Updated 9 years ago
• nbenton / coqdomains
  Domain theory and denotational semantics in Coq
  ☆10Updated 9 years ago
• pcapriotti / agda-categories
  Category theory and algebra
  ☆27Updated 8 years ago