Alternatives and similar repositories for pudding-old

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

• david-christiansen / tt-playground
  A playground for type theory implementations in Racket
  ☆20Updated 10 years ago
• 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
• Saizan / miller
  Miller/pattern unification in Agda
  ☆67Updated last month
• gbaz / mess
  Martin-Löf Extensible Specification and Simulator
  ☆29Updated 10 years ago
• wilbowma / cic-redex
  A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.
  ☆34Updated 8 years ago
• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆26Updated 10 years ago
• heades / System-F-Coq
  System F in coq.
  ☆19Updated 10 years ago
• pnwamk / stop2015-redex
  PLT Redex model of basic Dependently Typed Racket calculus
  ☆18Updated 10 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
• lexi-lambda / racket-higher-rank
  ☆21Updated 8 years ago
• wilbowma / dissertation
  The source for "Compiling with Dependent Types" (my dissertation)
  ☆30Updated 3 years ago
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆21Updated 7 years ago
• david-christiansen / epigram1
  A version of Epigram 1 that can run with newer GHCs
  ☆54Updated 8 years ago
• jonsterling / hs-abt
  Type safe abstract binding trees for Haskell, using Vinyl
  ☆16Updated 8 years ago
• TOTBWF / muprl
  A small NuPRL style proof assistant
  ☆31Updated 6 years ago
• pa-ba / calc-comp
  Coq proofs for the paper "Calculating Correct Compilers"
  ☆31Updated last year
• mietek / epigram2
  Mirror of Epigram 2, by Conor McBride, et al.
  ☆55Updated 5 years ago
• jozefg / miniprl
  A small implementation of a proof refinement logic.
  ☆50Updated 8 years ago
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆25Updated 6 years ago
• tov / alms
  The Alms Programming Language
  ☆44Updated 7 years ago
• agda-attic / agda-ocaml
  OCaml backend for Agda
  ☆39Updated 7 years ago
• mietek / research
  Work in progress
  ☆38Updated 5 months ago
• michaelballantyne / meta-minikanren
  A miniKanren interpreter... in miniKanren. Relationally run your relations relationally!
  ☆22Updated 9 years ago
• rowandavies / sml-cidre
  SML Checker for Intersection and Datasort Refinements (pronounced "cider")
  ☆20Updated 12 years ago
• ayberkt / sml-system-t
  SML implementation of System T from PFPL.
  ☆11Updated 8 years ago
• bitonic / tog
  ☆26Updated 8 years ago
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆31Updated 7 months ago
• RobertHarper / TILT-Compiler
  Standard ML compiler based on typed intermediate languages.
  ☆50Updated 11 years ago
• UCSD-PL / nano-smt
  "Toy" SMT Solver for Educational Purposes
  ☆20Updated 12 years ago