A type checker for the Lean theorem prover
☆40Mar 6, 2021Updated 5 years ago
Alternatives and similar repositories for nanoda
Users that are interested in nanoda are comparing it to the libraries listed below
Sorting:
- IODyn: A functional language for implicitly-incremental programs with dynamic input and output collections☆15Feb 22, 2018Updated 8 years ago
- Documented version of a simple type-theoretic language: Mini-TT☆18May 5, 2019Updated 6 years ago
- An experimental type checker for a modal dependent type theory.☆116May 9, 2020Updated 5 years ago
- An encoding of linear logic in Coq with minimal Sokoban and blocks world examples☆22Feb 4, 2022Updated 4 years ago
- Experiments with linear types☆14Feb 23, 2018Updated 8 years ago
- Extra and extended datatypes for Lean 4☆12Nov 12, 2022Updated 3 years ago
- Simply typed lambda calculus in cubical agda☆22Feb 22, 2020Updated 6 years ago
- A Model of Relationally Parametric System F in Coq☆22May 27, 2015Updated 10 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Dec 5, 2024Updated last year
- NbE course @ Chalmers☆28Sep 24, 2024Updated last year
- A tool for building Lean4 .olean files from Lean3 export data☆10Jul 28, 2021Updated 4 years ago
- IO using sized types and copatterns☆36Apr 14, 2021Updated 4 years ago
- A playground for type theory implementations in Racket☆20Dec 2, 2015Updated 10 years ago
- Label dependent dependent session types☆16May 2, 2024Updated last year
- ☆17Oct 16, 2018Updated 7 years ago
- Mechanized Theory of Event Structures☆16Aug 16, 2023Updated 2 years ago
- The multimode presheaf proof-assistant☆37Jan 23, 2026Updated last month
- A Certified Interpreter for ML with Structural Polymorphism☆45Apr 11, 2025Updated 10 months ago
- Haskell geometry library☆17Mar 15, 2020Updated 5 years ago
- Proof of concept of procedural macro input parsed by LALRPOP☆52Dec 19, 2022Updated 3 years ago
- Miller/pattern unification in Agda☆68Oct 29, 2025Updated 4 months ago
- ☆16Dec 28, 2021Updated 4 years ago
- LL(1) parser generator verified in Coq☆48Jan 30, 2020Updated 6 years ago
- Implementation of sprintf for Coq☆19Apr 6, 2020Updated 5 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14May 15, 2017Updated 8 years ago
- Experiments with preordered set models of (directed) type theories☆15Jul 10, 2019Updated 6 years ago
- Coq library for handling names☆19Aug 5, 2022Updated 3 years ago
- Formalising session types in Coq☆18Sep 6, 2019Updated 6 years ago
- Mtac in Agda☆29May 4, 2021Updated 4 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆37Mar 17, 2025Updated 11 months ago
- HoTT in Lean 3☆81Aug 3, 2020Updated 5 years ago
- A showcase of interesting code and proof developments in Cedille☆36Jun 10, 2025Updated 8 months ago
- ☆16Jun 17, 2017Updated 8 years ago
- A framework for implementing and certifying impure computations in Coq☆53Jan 16, 2024Updated 2 years ago
- ☆21Mar 15, 2016Updated 9 years ago
- Lean type-checker written in Scala.☆41Mar 13, 2022Updated 3 years ago
- Material for the Agda course at the EUTYPES Summer School '19 in Ohrid☆23Sep 3, 2019Updated 6 years ago
- A prototype programming language for programming with runners☆92Aug 20, 2021Updated 4 years ago
- Simplified Observational Type Theory☆87Feb 17, 2026Updated 2 weeks ago