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
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 6 months 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
- Linear map categories in Agda☆5Updated last year
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- Mirror of Conor McBride’s 2011 Agda course materials☆12Updated 6 years ago
- ☆17Updated 6 years ago
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"☆12Updated 7 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- A dependently typed type checker for a TT with intervals☆22Updated 5 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- ☆18Updated 2 years ago
- Dependently typed Algorithm M and friends☆25Updated 6 years ago
- A Self-Interpreter for F-omega☆16Updated 9 years ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- being an experiment with potato power☆23Updated 5 years ago
- Experimental normalisation via scheme☆12Updated 3 years ago
- Dependently typed elimination functions using singletons☆28Updated 3 months ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 4 months ago
- Agda code for experimenting with internal models of cubical type theory☆13Updated 7 years ago
- An interpreter for the concatenative language Joy, written in Haskell using extensible-effects☆35Updated 5 months ago
- Session types in Idris2!☆27Updated 4 years ago