Contextual types meet mechanized metatheory!
☆210Sep 30, 2025Updated 7 months ago
Alternatives and similar repositories for Beluga
Users that are interested in Beluga are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- An experimental type checker for a modal dependent type theory.☆120May 9, 2020Updated 6 years ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆32Updated this week
- 😎TT☆243Nov 20, 2025Updated 5 months ago
- Mechanizing Types and Programming Languages using Beluga☆21May 29, 2020Updated 5 years ago
- Linearizability Hoare Logic☆17Apr 24, 2026Updated 2 weeks ago
- End-to-end encrypted email - Proton Mail • AdSpecial offer: 40% Off Yearly / 80% Off First Month. All Proton services are open source and independently audited for security.
- Formalizations of strong normalization proofs☆35Jul 8, 2019Updated 6 years ago
- Quantitative Type Theory implementation☆54Jun 2, 2021Updated 4 years ago
- Inline, type safe X86-64 assembly programming in Agda☆70Jan 3, 2019Updated 7 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆87Sep 13, 2021Updated 4 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆45Apr 11, 2025Updated last year
- Simplified Observational Type Theory☆88Feb 17, 2026Updated 2 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆60Jun 18, 2024Updated last year
- A polynomial model of a Martin-Löf type theory + a bit of game semantics☆31Dec 3, 2021Updated 4 years ago
- flexible 'let rec' generation for MetaOCaml☆28Jan 25, 2026Updated 3 months ago
- Managed Kubernetes at scale on DigitalOcean • AdDigitalOcean Kubernetes includes the control plane, bandwidth allowance, container registry, automatic updates, and more for free.
- IO using sized types and copatterns☆36Apr 14, 2021Updated 5 years ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Nov 28, 2018Updated 7 years ago
- Experimenting on ornamentation in Agda via reflection.☆12Jul 1, 2023Updated 2 years ago
- "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory☆217Mar 25, 2022Updated 4 years ago
- ☆29Jun 23, 2022Updated 3 years ago
- Proof assistant based on the λΠ-calculus modulo rewriting☆388Apr 23, 2026Updated 2 weeks ago
- Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations☆393Oct 23, 2023Updated 2 years ago
- Toy typechecker for Insanely Dependent Types☆82Oct 15, 2025Updated 6 months ago
- Multimode simple type theory as an Agda library.☆23Sep 18, 2024Updated last year
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- Miller/pattern unification in Agda☆69Oct 29, 2025Updated 6 months ago
- Formalizations of Gradually Typed Languages in Agda☆59Mar 2, 2026Updated 2 months ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆56Sep 11, 2025Updated 7 months ago
- Normalization by Evaluation for Martin-Löf Type Theory☆135Jun 5, 2024Updated last year
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22May 20, 2021Updated 4 years ago
- A statically-typed linear functional language with graded modal types for fine-grained program reasoning☆711Apr 20, 2026Updated 2 weeks ago
- A small NuPRL style proof assistant☆31Jan 31, 2019Updated 7 years ago
- Normalization by evaluation for Martin-Löf Type Theory with dependent records☆103Jun 8, 2022Updated 3 years ago
- ☆14Dec 9, 2022Updated 3 years ago
- Proton VPN Special Offer - Get 70% off • AdSpecial partner offer. Trusted by over 100 million users worldwide. Tested, Approved and Recommended by Experts.
- A Toy Inverse Bidirectional Typechecker☆32May 13, 2019Updated 6 years ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆20Feb 26, 2021Updated 5 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Oct 4, 2020Updated 5 years ago
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆104May 16, 2025Updated 11 months ago
- Prototype implementations of systems based on setoid type theory☆66Nov 29, 2020Updated 5 years ago
- An enhanced unification algorithm for Coq☆60Apr 1, 2026Updated last month
- Quasi-quoting library for agda☆18Nov 29, 2024Updated last year