Alternatives and similar repositories for pudding-old

Users that are interested in pudding-old are comparing it to the libraries listed below

• david-christiansen / idris-interaction.rkt
  A Racket library for interacting with Idris over the IDE protocol
  ☆31Updated 7 years ago
• maxsnew / modal-scheme
  A Scheme-like CBPV language with Racket Interoperability
  ☆39Updated last year
• 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
  ☆65Updated 11 years ago
• gbaz / mess
  Martin-Löf Extensible Specification and Simulator
  ☆29Updated 10 years ago
• david-christiansen / tt-playground
  A playground for type theory implementations in Racket
  ☆20Updated 9 years ago
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆24Updated 5 years ago
• jonsterling / agda-effectful-forcing
  Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…
  ☆12Updated 4 years ago
• mietek / epigram2
  Mirror of Epigram 2, by Conor McBride, et al.
  ☆48Updated 5 years ago
• pa-ba / McCarthy-Painter
  Coq proof for the paper "Compiling a Fifty Year Journey"
  ☆13Updated 7 years ago
• lexi-lambda / racket-higher-rank
  ☆21Updated 8 years ago
• heades / System-F-Coq
  System F in coq.
  ☆19Updated 10 years ago
• jozefg / miniprl
  A small implementation of a proof refinement logic.
  ☆50Updated 8 years ago
• jyp / prettiest
  The Prettiest Printer
  ☆35Updated last year
• jonsterling / hs-abt
  Type safe abstract binding trees for Haskell, using Vinyl
  ☆16Updated 7 years ago
• david-christiansen / epigram1
  A version of Epigram 1 that can run with newer GHCs
  ☆52Updated 7 years ago
• mietek / research
  Work in progress
  ☆37Updated last month
• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆26Updated 10 years ago
• pigworker / Bi71
  being a bidirectional reformulation of Martin-Löf's 1971 type theory
  ☆25Updated 7 years ago
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆19Updated 6 years ago
• TOTBWF / muprl
  A small NuPRL style proof assistant
  ☆31Updated 6 years ago
• frelindb / agsyHOL
  ☆22Updated 9 years ago
• pnwamk / stop2015-redex
  PLT Redex model of basic Dependently Typed Racket calculus
  ☆18Updated 10 years ago
• clf / celf
  ☆60Updated 6 years ago
• SMLFamily / The-Mechanization-of-Standard-ML
  The Mechanization of Standard ML
  ☆73Updated 2 years ago
• L-TChen / FiniteSets
  Fintie Sets in Cubical Agda
  ☆12Updated 5 years ago
• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆73Updated 3 years ago
• msp-strath / ZEUG
  being the beginnings of at least zero typecheckers
  ☆34Updated 8 years ago
• andreasabel / ipl
  Agda formalization of Intuitionistic Propositional Logic
  ☆22Updated 3 weeks ago
• mietek / et-lang
  ET (IPL) language interpreters and literature
  ☆26Updated 6 years ago