Alternatives and similar repositories for abbot

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

• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆26Updated 10 years ago
• pigworker / potato
  being an experiment with potato power
  ☆23Updated 5 years ago
• wilbowma / cic-redex
  A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.
  ☆34Updated 8 years ago
• Saizan / miller
  Miller/pattern unification in Agda
  ☆66Updated last month
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆36Updated 4 years ago
• joom / WangsAlgorithm
  A classical propositional theorem prover in Haskell, using Wang's Algorithm.
  ☆36Updated 6 years ago
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆21Updated 7 years ago
• ISANobody / sill
  ☆29Updated 10 years ago
• jonsterling / hs-abt
  Type safe abstract binding trees for Haskell, using Vinyl
  ☆16Updated 8 years ago
• dorchard / effects-as-sessions
  Formalised embedding of an imperative language with effect system into session-typed pi calculus.
  ☆29Updated last year
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 8 years ago
• zydeco-lang / fiddle
  A dynamically-typed CBPV language embedded in Racket
  ☆39Updated last year
• rowandavies / sml-cidre
  SML Checker for Intersection and Datasort Refinements (pronounced "cider")
  ☆20Updated 12 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 6 years ago
• david-christiansen / pudding-old
  A language-integrated proof assistant, for and in Racket
  ☆39Updated 9 years ago
• david-christiansen / tt-playground
  A playground for type theory implementations in Racket
  ☆20Updated 10 years ago
• OPLSS / oplss-notes-2017
  handouts and notes from the 2017 edition of the summer school
  ☆39Updated 8 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆49Updated 4 years ago
• jonsterling / coq-guarded-computational-type-theory
  ☆21Updated 7 years ago
• metaborg / linear.agda
  A library and case-study for linear, intrinsically-typed interpreters in Agda
  ☆36Updated 6 years ago
• jozefg / miniprl
  A small implementation of a proof refinement logic.
  ☆50Updated 8 years ago
• benjaminselfridge / logix
  Logic Explorer - customizable proof construction tool for sequent calculi
  ☆21Updated 3 years ago
• mietek / research
  Work in progress
  ☆38Updated 6 months ago
• annenkov / two-level
  Two-Level Type Theory
  ☆28Updated 6 years ago
• dlicata335 / hott-agda
  ☆84Updated 8 years ago
• gallais / pearl-binary-search
  Functional Pearl: Certified Binary Search in a Read-Only Array
  ☆29Updated 4 years ago
• vrahli / NuprlInCoq
  Implementation of Nuprl's type theory in Coq
  ☆46Updated last year
• plum-umd / cgc
  Constructive Galois connections
  ☆36Updated 7 years ago
• dboulytchev / miniKanren-coq
  A certified semantics for relational programming workout.
  ☆26Updated 5 years ago
• tuura / selective-theory-coq
  Selective applicative functors laws and theorems
  ☆14Updated 5 years ago