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 8 years ago
• zydeco-lang / fiddle
  A dynamically-typed CBPV language embedded in Racket
  ☆39Updated last year
• david-christiansen / tt-playground
  A playground for type theory implementations in Racket
  ☆20Updated 10 years ago
• Saizan / miller
  Miller/pattern unification in Agda
  ☆66Updated 2 months ago
• wilbowma / cic-redex
  A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.
  ☆34Updated 8 years ago
• gbaz / mess
  Martin-Löf Extensible Specification and Simulator
  ☆29Updated 10 years ago
• lexi-lambda / racket-higher-rank
  ☆21Updated 8 years ago
• david-christiansen / epigram1
  A version of Epigram 1 that can run with newer GHCs
  ☆55Updated 8 years ago
• mietek / research
  Work in progress
  ☆39Updated 7 months ago
• uwplse / CoqAST
  Fun plugin to play with the Gallina AST.
  ☆38Updated 6 years ago
• heades / System-F-Coq
  System F in coq.
  ☆19Updated 10 years ago
• pa-ba / McCarthy-Painter
  Coq proof for the paper "Compiling a Fifty Year Journey"
  ☆13Updated 8 years ago
• jyp / prettiest
  The Prettiest Printer
  ☆35Updated last year
• pnwamk / stop2015-redex
  PLT Redex model of basic Dependently Typed Racket calculus
  ☆18Updated 10 years ago
• jozefg / miniprl
  A small implementation of a proof refinement logic.
  ☆50Updated 8 years ago
• mietek / epigram2
  Mirror of Epigram 2, by Conor McBride, et al.
  ☆57Updated 5 years ago
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆78Updated 12 years ago
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆21Updated 7 years ago
• ayberkt / sml-system-t
  SML implementation of System T from PFPL.
  ☆11Updated 8 years ago
• bitonic / tog
  ☆26Updated 8 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) -…
  ☆13Updated 5 years ago
• TOTBWF / muprl
  A small NuPRL style proof assistant
  ☆31Updated 6 years ago
• agda-attic / agda-ocaml
  OCaml backend for Agda
  ☆39Updated 7 years ago
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆25Updated 6 years ago
• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆77Updated 3 years ago
• gasche / popl2018-papers
  Link to preprints for POPL'18 and colocated events
  ☆86Updated 7 years ago
• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆26Updated 10 years ago
• SMLFamily / The-Mechanization-of-Standard-ML
  The Mechanization of Standard ML
  ☆74Updated 3 years ago
• csgordon / cayenne
  Resurrecting Lennart Augustsson's implementation of Cayenne
  ☆38Updated 12 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 7 years ago