Alternatives and similar repositories for mess

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

• wilbowma / cic-redex
  A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.
  ☆34Updated 8 years ago
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆31Updated 3 months ago
• TOTBWF / muprl
  A small NuPRL style proof assistant
  ☆31Updated 6 years ago
• Saizan / miller
  Miller/pattern unification in Agda
  ☆65Updated 11 years ago
• david-christiansen / pudding-old
  A language-integrated proof assistant, for and in Racket
  ☆39Updated 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 9 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 6 years ago
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆24Updated 6 years ago
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆19Updated 6 years ago
• david-christiansen / idris-interaction.rkt
  A Racket library for interacting with Idris over the IDE protocol
  ☆31Updated 7 years ago
• david-christiansen / epigram1
  A version of Epigram 1 that can run with newer GHCs
  ☆53Updated 8 years ago
• mietek / research
  Work in progress
  ☆37Updated 2 months ago
• csgordon / cayenne
  Resurrecting Lennart Augustsson's implementation of Cayenne
  ☆38Updated 12 years ago
• lexi-lambda / racket-higher-rank
  ☆21Updated 8 years ago
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆78Updated 11 years ago
• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆26Updated 10 years ago
• ziman / itt-idris
  ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2
  ☆23Updated 8 months ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆35Updated 4 years ago
• heades / System-F-Coq
  System F in coq.
  ☆19Updated 10 years ago
• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆75Updated 3 years ago
• scmu / foundations-harper
  Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.
  ☆53Updated 6 years ago
• andreasabel / ipl
  Agda formalization of Intuitionistic Propositional Logic
  ☆22Updated 2 months ago
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 8 years ago
• pnwamk / stop2015-redex
  PLT Redex model of basic Dependently Typed Racket calculus
  ☆18Updated 10 years ago
• pa-ba / calc-comp
  Coq proofs for the paper "Calculating Correct Compilers"
  ☆30Updated last year
• sstucki / pts-agda
  A formalization of Pure Type Systems (PTS) in Agda
  ☆27Updated last month
• pa-ba / McCarthy-Painter
  Coq proof for the paper "Compiling a Fifty Year Journey"
  ☆13Updated 7 years ago
• dorchard / effects-as-sessions
  Formalised embedding of an imperative language with effect system into session-typed pi calculus.
  ☆29Updated 8 months ago
• jespercockx / reflection-tutorial
  ☆17Updated 6 years ago