Mechanizing Types and Programming Languages using Beluga
☆21May 29, 2020Updated 5 years ago
Alternatives and similar repositories for Meta
Users that are interested in Meta are comparing it to the libraries listed below
Sorting:
- SML implementation of System T from PFPL.☆11Jun 28, 2017Updated 8 years ago
- Explaining category theory by example☆10Jun 30, 2017Updated 8 years ago
- Experiments in formalizing refinement type systems in Coq☆18Feb 7, 2016Updated 10 years ago
- A reflection-based proof tactic for lattices in Coq☆21Oct 15, 2023Updated 2 years ago
- Spacemacs Layer for LiquidHaskell☆13Jun 10, 2017Updated 8 years ago
- ☆17Oct 16, 2018Updated 7 years ago
- HoTT Book formalisations in Rzk.☆20Dec 15, 2023Updated 2 years ago
- ATS-Postiats-contrib is primarily for packages contributed to ATS-Postiats☆51Aug 3, 2020Updated 5 years ago
- My master thesis about generic programming and ornaments☆16Jul 5, 2016Updated 9 years ago
- being the materials for Summer 2013's course☆113Apr 25, 2023Updated 2 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Dec 8, 2021Updated 4 years ago
- Anders: Cubical Type Checker☆23Oct 23, 2023Updated 2 years ago
- Agda formalisation of NbE for λ□☆18Dec 5, 2017Updated 8 years ago
- Companion code for "Why Dependent Types Matter" paper.☆60Jun 14, 2018Updated 7 years ago
- Create string diagrams with LaTeX!☆14Jan 3, 2025Updated last year
- Yet another haskell term rewriting library☆18Aug 27, 2025Updated 6 months ago
- ☆12May 22, 2016Updated 9 years ago
- Hakyll support for Agda literate files☆19Jul 20, 2021Updated 4 years ago
- ☆11Jul 20, 2016Updated 9 years ago
- Proof combinators used in Liquid Haskell for theorem proving☆12Mar 28, 2018Updated 7 years ago
- Experimental normalisation via scheme☆12Jul 25, 2021Updated 4 years ago
- Using Forester, We are attempting to resurrect and grow the since deleted model theory wiki and give it a better foundation for future gr…☆16Jun 8, 2025Updated 8 months ago
- A partial implementation of Protocol Buffers in Idris☆32Aug 12, 2017Updated 8 years ago
- A language-integrated proof assistant, for and in Racket☆39Aug 26, 2016Updated 9 years ago
- Coq formalizations of Sequent Calculus, Natural Deduction, etc. systems for propositional logic☆45May 14, 2016Updated 9 years ago
- Type-level well-kinded natural numbers.☆36Jan 2, 2025Updated last year
- Haskell implementation of the Edinburgh Logical Framework☆32Jan 12, 2026Updated last month
- A formalization of Constructive Projective Geometry in Agda☆12Jun 10, 2019Updated 6 years ago
- being an implementation of the calculus of constructions☆17Mar 9, 2023Updated 2 years ago
- Type-Theory in Sequent Calculus☆14Jul 30, 2015Updated 10 years ago
- A collection of SML utility modules that are useful for compiler writing.☆11Dec 17, 2025Updated 2 months ago
- Collects examples used to produce the paper 'Session Types with Linearity in Haskell' by Orchard and Yoshida (2017).☆12Nov 28, 2023Updated 2 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Sep 11, 2025Updated 5 months ago
- Organization and planning for the Initial Types Club☆75Sep 22, 2022Updated 3 years ago
- First-order automated theorem prover based on the tableau method☆18Jan 3, 2026Updated last month
- JNumberTools is an open-source Java library for solving complex problems in combinatorics and number theory. Whether you're a researcher,…☆12May 13, 2025Updated 9 months ago
- Attempting to create Optics and other Computational structures from scratch☆13Oct 25, 2025Updated 4 months ago
- ☆17Jun 10, 2022Updated 3 years ago
- A small implementation of a proof refinement logic.☆50Jul 3, 2017Updated 8 years ago