Minimal, efficient proof language
☆15May 28, 2019Updated 6 years ago
Alternatives and similar repositories for Elementary-Affine-Type-Theory-legacy
Users that are interested in Elementary-Affine-Type-Theory-legacy are comparing it to the libraries listed below
Sorting:
- A simple, untyped, terminating functional language that is fully compatible with optimal reductions.☆18Jun 17, 2019Updated 6 years ago
- Multiplication on optimal λ-calculus reducers☆23Aug 14, 2020Updated 5 years ago
- Base Formality libraries☆10Mar 4, 2019Updated 7 years ago
- An implementation of the Formality language in C☆13Oct 12, 2019Updated 6 years ago
- An implementation of the Formality language in JavaScript☆71Aug 27, 2019Updated 6 years ago
- Thoughts and stuff☆72Apr 30, 2020Updated 5 years ago
- Specification of the Formality proof and programming language☆42Feb 5, 2023Updated 3 years ago
- Agda libraries relevant to Moonad☆15Apr 2, 2019Updated 6 years ago
- A Peer-to-Peer Operating System☆37Mar 17, 2019Updated 6 years ago
- Absal ex☆60Sep 8, 2023Updated 2 years ago
- ☆16May 5, 2018Updated 7 years ago
- A Haskell implementation of the Formality language☆18Mar 9, 2020Updated 6 years ago
- ☆37Nov 16, 2021Updated 4 years ago
- Agda suffices: software written from A to Z in Agda☆16Mar 31, 2019Updated 6 years ago
- Interactive windows for displaying Haskell-generated diagrams☆18Sep 17, 2024Updated last year
- Benchmarking various normalization algorithms for the lambda calculus☆49Sep 1, 2022Updated 3 years ago
- An extension of the NbE algorithm to produce computational traces☆22May 5, 2022Updated 3 years ago
- A small Coq library for collecting side conditions and deferring their proof☆26Oct 14, 2019Updated 6 years ago
- Experiments in formalizing refinement type systems in Coq☆18Feb 7, 2016Updated 10 years ago
- Set up a specific version of Agda for your GitHub Actions workflow.☆28Nov 24, 2025Updated 3 months ago
- Tiny type-checker with dependent types☆78Jan 8, 2014Updated 12 years ago
- Formalizations of Gradually Typed Languages in Agda☆59Mar 2, 2026Updated last week
- Dependently typed Algorithm M and friends☆26Jun 2, 2018Updated 7 years ago
- A nano "theorem prover".☆63Feb 15, 2019Updated 7 years ago
- Moonad: a Peer-to-Peer Operating System☆101Dec 7, 2019Updated 6 years ago
- Invertible parsing for S-expressions☆34Feb 4, 2026Updated last month
- An experimental type checker for a modal dependent type theory.☆116May 9, 2020Updated 5 years ago
- Syntax for Virtual Equipments: a natural syntax for doing synthetic and internal category theory☆32Apr 29, 2023Updated 2 years ago
- Programming library for Agda☆135Aug 22, 2024Updated last year
- Toy typechecker for Insanely Dependent Types☆82Oct 15, 2025Updated 4 months ago
- Formalizations of strong normalization proofs☆35Jul 8, 2019Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Jan 11, 2019Updated 7 years ago
- A showcase of interesting code and proof developments in Cedille☆36Jun 10, 2025Updated 9 months ago
- A Unifying Cartesian Cubical Set Model☆35Oct 14, 2019Updated 6 years ago
- A self-hosting mini Haskell compiler with a mini C runtime.☆78Dec 22, 2019Updated 6 years ago
- A formalization of continuation-passing style calculi in Coq [WIP]☆38Updated this week
- Free Algebras in Haskell☆38Aug 29, 2024Updated last year
- My Own Linear Lisp☆42Aug 24, 2018Updated 7 years ago
- A tiny event emitter in C☆18Nov 21, 2014Updated 11 years ago