Alternatives and similar repositories for free-proving

Users that are interested in free-proving are comparing it to the libraries listed below

• effectfully / STLC
  Dependently typed Algorithm M and friends
  ☆25Updated 7 years ago
• jonsterling / agda-zipper-machine
  An abstract machine using indexed containers and their zippers
  ☆14Updated 8 years ago
• takanuva / coc
  Calculus of Constructions
  ☆17Updated 6 years ago
• andreasabel / strong-normalization
  Formalizations of strong normalization proofs
  ☆35Updated 6 years ago
• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆26Updated 10 years ago
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆21Updated 6 years ago
• twanvl / ttie
  Type Theory with Indexed Equality
  ☆26Updated 8 years ago
• L-TChen / MtacAR
  Mtac in Agda
  ☆28Updated 4 years ago
• FreeProving / free-compiler
  A Haskell to Coq compiler that represents effectful programs with the free monad
  ☆45Updated 3 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆36Updated 4 years ago
• langston-barrett / coq-big-o
  A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.
  ☆35Updated 8 years ago
• ayberkt / Mini-TT
  A tiny implementation of dependent types.
  ☆11Updated 7 years ago
• pcapriotti / agda-categories
  Category theory and algebra
  ☆27Updated 9 years ago
• metaborg / linear.agda
  A library and case-study for linear, intrinsically-typed interpreters in Agda
  ☆35Updated 5 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 6 years ago
• gergoerdi / universe-of-syntax
  A universe of scope- and type-safe syntaxes (syntices?). Includes generic implementation of type-preserving renaming/substitution with al…
  ☆16Updated 7 years ago
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆31Updated 4 months ago
• ericfinster / opetopes-in-agda
  Formalization of Opetopes and Opetopic Sets in Agda
  ☆18Updated 8 years ago
• effectfully / Cubes
  A dependently typed type checker for a TT with intervals
  ☆23Updated 5 years ago
• benjaminselfridge / logix
  Logic Explorer - customizable proof construction tool for sequent calculi
  ☆20Updated 3 years ago
• wenkokke / idris-sesh
  Session types in Idris2!
  ☆27Updated 4 years ago
• heades / System-F-Coq
  System F in coq.
  ☆19Updated 10 years ago
• letouzey / coq-minicalc
  Toy demo of lexing/parsing in Coq
  ☆12Updated 6 years ago
• ayberkt / simplc
  A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.
  ☆16Updated 5 years ago
• jonsterling / coq-domains
  ☆18Updated 3 years ago
• bitonic / hakyll-agda
  Hakyll support for Agda literate files
  ☆19Updated 4 years ago
• jespercockx / reflection-tutorial
  ☆17Updated 6 years ago
• sstucki / pts-agda
  A formalization of Pure Type Systems (PTS) in Agda
  ☆27Updated 2 months ago
• dorchard / effects-as-sessions
  Formalised embedding of an imperative language with effect system into session-typed pi calculus.
  ☆29Updated 9 months ago
• andreasabel / ipl
  Agda formalization of Intuitionistic Propositional Logic
  ☆22Updated 3 months ago