TOTBWF / muprl
A small NuPRL style proof assistant
☆32Updated 5 years ago
Related projects ⓘ
Alternatives and complementary repositories for muprl
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆19Updated 2 years ago
- Linear map categories in Agda☆5Updated last year
- Haskell implementation of the Edinburgh Logical Framework☆26Updated last month
- A dependently typed type checker for a TT with intervals☆21Updated 4 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 9 years ago
- Mirror of Conor McBride’s 2011 Agda course materials☆11Updated 5 years ago
- A bare-bones LCF-style proof assistant☆21Updated 5 years ago
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"☆11Updated 6 years ago
- Generalized syntax & semantics for universe hierarchies☆28Updated 11 months ago
- being an experiment with potato power☆23Updated 4 years ago
- A package Index for agda libraries☆12Updated 3 years ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- A usable type system for call by push-value☆28Updated 4 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 5 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 4 years ago
- ☆17Updated 6 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- being the programs and code for a paper about general recursion☆24Updated 9 years ago
- Experiments in Synthetic Differential Geometry☆15Updated 3 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- ☆23Updated 7 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 4 years ago
- ☆18Updated 2 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
- Type Theory with Indexed Equality☆23Updated 7 years ago
- Dependently typed Algorithm M and friends☆25Updated 6 years ago