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 Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 5 months ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A language-integrated proof assistant, for and in Racket☆39Updated 9 years ago
- Miller/pattern unification in Agda☆68Updated 11 years ago
- A bare-bones LCF-style proof assistant☆24Updated 6 years ago
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- A small NuPRL style proof assistant☆31Updated 6 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- A Racket library for interacting with Idris over the IDE protocol☆31Updated 7 years ago
- System F in coq.☆19Updated 10 years ago
- ☆26Updated 8 years ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- A discouraging story.☆16Updated 7 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Updated 6 years ago
- Work in progress☆38Updated 4 months ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 4 months ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 10 months ago
- ☆17Updated 7 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 3 months ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 10 months ago