TOTBWF / muprlLinks
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:
- Martin-Löf Extensible Specification and Simulator☆29Updated 10 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
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 10 months ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 5 months ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- Experimental normalisation via scheme☆12Updated 4 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
- IO using sized types and copatterns☆36Updated 4 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- ☆17Updated 7 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- Dependently typed elimination functions using singletons☆28Updated 9 months ago
- A usable type system for call by push-value☆33Updated 5 years ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 10 months ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- SML implementation of System T from PFPL.☆11Updated 8 years ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Updated last year
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 12 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 3 months ago
- An interpreter for the concatenative language Joy, written in Haskell using extensible-effects☆35Updated 11 months ago
- A language-integrated proof assistant, for and in Racket☆39Updated 9 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago