Alternatives and similar repositories for RingIdris:

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

• OPLSS / oplss-notes-2017
  handouts and notes from the 2017 edition of the summer school
  ☆39Updated 7 years ago
• pigworker / Bi71
  being a bidirectional reformulation of Martin-Löf's 1971 type theory
  ☆25Updated 7 years ago
• effectfully / OTT
  Observational Type Theory as an Agda library
  ☆52Updated 7 years ago
• agda / ooAgda
  Interactive and object-oriented programming in Agda using coinductive types
  ☆23Updated 4 months ago
• pcapriotti / agda-categories
  Category theory and algebra
  ☆28Updated 8 years ago
• edwinb / Vars
  A small library for tracking mutable state in Idris programs
  ☆12Updated 8 years ago
• mikeshulman / cohesivett
  Cohesive type theory
  ☆19Updated 3 years ago
• agda-attic / agda-frp-ltl
  An implementation of Functional Reactive Programming
  ☆40Updated 10 years ago
• bmsherman / topology
  Formal topology (and some probability) in Coq
  ☆32Updated 6 years ago
• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆25Updated 10 years ago
• crypto-agda / crypto-agda
  Cryptographic Constructions in the Type Theory of Agda
  ☆52Updated 9 years ago
• ecaustin / haskhol-core
  The core logical system of the HaskHOL theorem prover. See haskhol.org for more details.
  ☆2Updated 8 years ago
• pcapriotti / agda-base
  Base library for HoTT in Agda
  ☆37Updated 6 years ago
• japesinator / Idris-Bifunctors
  A small bifunctor library for idris
  ☆21Updated 4 years ago
• nbenton / coqdomains
  Domain theory and denotational semantics in Coq
  ☆10Updated 10 years ago
• boyland / twelf-library
  Library classes for the Twelf Proof System
  ☆21Updated 4 years ago
• vmchale / permutations
  Provides a type-safe way of working with permutations in Idris
  ☆35Updated 3 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆29Updated 6 years ago
• ericfinster / catt
  Coherence typechecker for Grothendieck/Maltsiniotis style infinity categories
  ☆14Updated 8 years ago
• mietek / formal-logic
  TODO
  ☆23Updated 9 years ago
• heades / System-F-Coq
  System F in coq.
  ☆19Updated 10 years ago
• puffnfresh / tryidris
  Try Idris
  ☆35Updated 9 years ago
• jozefg / miniprl
  A small implementation of a proof refinement logic.
  ☆50Updated 7 years ago
• andyarvanitis / idris-cplusplus
  Experimental C++11 backend for Idris
  ☆14Updated 10 years ago
• david-christiansen / epigram1
  A version of Epigram 1 that can run with newer GHCs
  ☆52Updated 7 years ago
• GaloisInc / lean-haskell-bindings
  Haskell Bindings to the Lean Theorem Prover http://leanprover.github.io/
  ☆21Updated 7 years ago
• mietek / research
  Work in progress
  ☆34Updated 4 months ago
• mikeshulman / dirtt
  Directed type theory for formal category theory
  ☆17Updated 8 years ago
• agda-attic / agda-system-io
  Bindings to Haskell's IO monad which respect Agda's semantics
  ☆24Updated 6 years ago
• ezyang / lr-agda
  Logical relations proof in Agda
  ☆26Updated 9 years ago