gbaz / messLinks
Martin-Löf Extensible Specification and Simulator
☆29Updated 10 years ago
Alternatives and similar repositories for mess
Users that are interested in mess are comparing it to the libraries listed below
Sorting:
- A language-integrated proof assistant, for and in Racket☆39Updated 9 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- Miller/pattern unification in Agda☆67Updated last month
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 6 months ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- A Racket library for interacting with Idris over the IDE protocol☆31Updated 8 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- The Prettiest Printer☆35Updated last year
- IO using sized types and copatterns☆36Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆31Updated last year
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 11 months ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Generalized syntax & semantics for universe hierarchies☆32Updated last year
- PLT Redex model of basic Dependently Typed Racket calculus☆18Updated 10 years ago
- being an experiment with potato power☆23Updated 5 years ago
- ☆26Updated 8 years ago
- A monadic approach to static analysis following the methodology of AAM☆18Updated 10 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- classical sequent calculus, embedded in Haskell☆21Updated 3 months ago
- ☆21Updated 8 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 2 weeks ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago