Contextual types meet mechanized metatheory!
☆212Sep 30, 2025Updated 11 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.☆122May 9, 2020Updated 6 years ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆32Aug 5, 2026Updated last month
- 😎TT☆246Nov 20, 2025Updated 9 months ago
- Mechanizing Types and Programming Languages using Beluga☆23May 29, 2020Updated 6 years ago
- Formalizations of strong normalization proofs☆35Jul 8, 2019Updated 7 years ago
- Managed Database hosting by DigitalOcean • AdPostgreSQL, MySQL, MongoDB, Kafka, Valkey, and OpenSearch available. Automatically scale up storage and focus on building your apps.
- Quantitative Type Theory implementation☆54Jun 2, 2021Updated 5 years ago
- A prototypical dependently typed languages with sized types and variances☆115Jan 12, 2026Updated 7 months 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.☆89Sep 13, 2021Updated 4 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆45Apr 11, 2025Updated last year
- Unification and type inference algorithms☆127Feb 21, 2015Updated 11 years ago
- ☆14Dec 9, 2022Updated 3 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆61Jun 18, 2024Updated 2 years ago
- Simplified Observational Type Theory☆91Feb 17, 2026Updated 6 months ago
- Managed Kubernetes at scale on DigitalOcean • AdDigitalOcean Kubernetes includes the control plane, bandwidth allowance, container registry, automatic updates, and more for free.
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆44Nov 28, 2018Updated 7 years ago
- flexible 'let rec' generation for MetaOCaml☆29Jan 25, 2026Updated 7 months ago
- A polynomial model of a Martin-Löf type theory + a bit of game semantics☆31Dec 3, 2021Updated 4 years ago
- IO using sized types and copatterns☆36Apr 14, 2021Updated 5 years ago
- Multimode simple type theory as an Agda library.☆22Sep 18, 2024Updated last year
- Experimenting on ornamentation in Agda via reflection.☆12Jul 1, 2023Updated 3 years ago
- ☆29Jun 23, 2022Updated 4 years ago
- Proof assistant based on the λΠ-calculus modulo rewriting☆398Updated this week
- "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory☆220Mar 25, 2022Updated 4 years ago
- 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.
- Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations☆393Oct 23, 2023Updated 2 years ago
- Formalizations of Gradually Typed Languages in Agda☆59Mar 2, 2026Updated 6 months ago
- Toy typechecker for Insanely Dependent Types☆88Oct 15, 2025Updated 10 months ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆57Sep 11, 2025Updated 11 months ago
- A statically-typed linear functional language with graded modal types for fine-grained program reasoning☆732Jul 21, 2026Updated last month
- Normalization by Evaluation for Martin-Löf Type Theory☆136Jun 5, 2024Updated 2 years ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22May 20, 2021Updated 5 years ago
- ☆21Apr 15, 2018Updated 8 years ago
- Normalization by evaluation for Martin-Löf Type Theory with dependent records☆103Jun 8, 2022Updated 4 years ago
- Serverless GPU API endpoints on Runpod - Get Bonus Credits • AdSkip the infrastructure headaches. Auto-scaling, pay-as-you-go, no-ops approach lets you focus on innovating your application.
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆25Oct 4, 2020Updated 5 years ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆20Feb 26, 2021Updated 5 years ago
- An enhanced unification algorithm for Coq☆60Aug 31, 2026Updated last week
- A Toy Inverse Bidirectional Typechecker☆33May 13, 2019Updated 7 years ago
- A small NuPRL style proof assistant☆31Jan 31, 2019Updated 7 years ago
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆105May 16, 2025Updated last year
- Prototype implementations of systems based on setoid type theory☆66Nov 29, 2020Updated 5 years ago