TOTBWF / muprl
A small NuPRL style proof assistant
☆31Updated 6 years ago
Alternatives and similar repositories for muprl
Users that are interested in muprl are comparing it to the libraries listed below
Sorting:
- 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
- Haskell implementation of the Edinburgh Logical Framework☆28Updated last week
- ☆17Updated 6 years ago
- Mirror of Conor McBride’s 2011 Agda course materials☆12Updated 6 years ago
- Linear map categories in Agda☆5Updated 2 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 5 months ago
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Updated 2 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"☆12Updated 7 years ago
- A Self-Interpreter for F-omega☆16Updated 9 years ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- An implementation of scoped algebraic effects and handlers in Agda.☆12Updated 4 years ago
- ☆18Updated 3 years ago
- Session types in Idris2!☆27Updated 4 years ago
- being an experiment with potato power☆23Updated 5 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 10 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆12Updated 4 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 5 months ago
- Dependently typed Algorithm M and friends☆25Updated 6 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated last month
- Martin-Löf Extensible Specification and Simulator☆29Updated 9 years ago