jyp / nano-AgdaView external linksLinks
Tiny type-checker with dependent types
☆78Jan 8, 2014Updated 12 years ago
Alternatives and similar repositories for nano-Agda
Users that are interested in nano-Agda are comparing it to the libraries listed below
Sorting:
- Agda formalization of Intuitionistic Propositional Logic☆22Nov 14, 2025Updated 3 months ago
- Mtac in Agda☆29May 4, 2021Updated 4 years ago
- Calculus of Constructions☆17Jul 17, 2019Updated 6 years ago
- SML implementation of System T from PFPL.☆11Jun 28, 2017Updated 8 years ago
- An experimental type checker for a modal dependent type theory.☆116May 9, 2020Updated 5 years ago
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- Agda suffices: software written from A to Z in Agda☆16Mar 31, 2019Updated 6 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Jan 17, 2020Updated 6 years ago
- Resurrecting Lennart Augustsson's implementation of Cayenne☆38Jul 23, 2013Updated 12 years ago
- Toy typechecker for Insanely Dependent Types☆82Oct 15, 2025Updated 4 months ago
- Observational Type Theory as an Agda library☆57May 27, 2017Updated 8 years ago
- Dependently typed Algorithm M and friends☆26Jun 2, 2018Updated 7 years ago
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Jun 3, 2017Updated 8 years ago
- A Model of Relationally Parametric System F in Coq☆22May 27, 2015Updated 10 years ago
- A language-integrated proof assistant, for and in Racket☆39Aug 26, 2016Updated 9 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Jul 24, 2019Updated 6 years ago
- Coq formalizations of Sequent Calculus, Natural Deduction, etc. systems for propositional logic☆45May 14, 2016Updated 9 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Aug 31, 2019Updated 6 years ago
- Pure Type Systems for Functional Programming☆31Nov 21, 2020Updated 5 years ago
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆150Sep 30, 2021Updated 4 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆21Jun 3, 2022Updated 3 years ago
- "Toy" SMT Solver for Educational Purposes☆20Apr 17, 2013Updated 12 years ago
- STLC-related snippets in Agda☆16May 1, 2013Updated 12 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30May 10, 2022Updated 3 years ago
- Multimode simple type theory as an Agda library.☆23Sep 18, 2024Updated last year
- A bare-bones LCF-style proof assistant☆25Aug 13, 2019Updated 6 years ago
- Logical relations proof in Agda☆27May 27, 2015Updated 10 years ago
- Self-contained repository for the eponymous paper☆30Jan 11, 2019Updated 7 years ago
- A simple implementation of linear type theory☆39Apr 21, 2017Updated 8 years ago
- Type level algebraic "proofs" using lens combinators☆19Jul 26, 2019Updated 6 years ago
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆23Dec 14, 2016Updated 9 years ago
- Formalisation of the linear lambda calculus in Coq☆10Dec 2, 2018Updated 7 years ago
- ☆11Jul 20, 2016Updated 9 years ago
- Extra and extended datatypes for Lean 4☆12Nov 12, 2022Updated 3 years ago
- Lexer and parser generators for Standard ML, OCaml, and Haskell.☆38Aug 19, 2022Updated 3 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆36May 14, 2017Updated 8 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆131Jun 5, 2024Updated last year
- ☆26Feb 7, 2017Updated 9 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