Elaboration of cumulative universe hierarchies
☆13Oct 12, 2026Updated 2 weeks ago
Alternatives and similar repositories for elaboration-universes
Users that are interested in elaboration-universes are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Experiments on implementing Dependent Pattern Matching under Normalization by Evaluation setup.☆15Oct 3, 2026Updated 3 weeks ago
- ☆13Jun 18, 2025Updated last year
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆23Jan 30, 2024Updated 2 years ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆23Oct 2, 2026Updated 3 weeks ago
- being an implementation of the calculus of constructions☆17Mar 9, 2023Updated 3 years ago
- GPU virtual machines on DigitalOcean Gradient AI • AdGet to production fast with high-performance AMD and NVIDIA GPUs you can spin up in seconds. The definition of operational simplicity.
- Setoid type theory implementation☆41Aug 24, 2023Updated 3 years ago
- A type theory for tiny objects☆20Mar 6, 2026Updated 7 months ago
- An agda library for developing synthetic category theory - and other synthetic mathematics☆35Updated this week
- Linearizability Hoare Logic☆18Sep 16, 2026Updated last month
- algebraic typechecking and elaboration of type systems☆13Jan 25, 2025Updated last year
- 🩺 A library for compiler diagnostics☆56Oct 19, 2026Updated last week
- A formalized proof of a version of the initiality conjecture☆48Sep 10, 2020Updated 6 years ago
- A cost-aware logical framework, embedded in Agda.☆80Oct 8, 2026Updated 2 weeks 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
- 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.
- Experimental implementation of a Cubical Type Theory modeled by presheaves over posets☆13Aug 19, 2024Updated 2 years ago
- Synthetic Tait computability in intensional type theory☆18Jul 13, 2026Updated 3 months ago
- Work in progress on semi-simplicial types☆25Dec 15, 2022Updated 3 years ago
- Intrinsic Verification of Formal Grammar Theory☆29Aug 4, 2026Updated 2 months ago
- Toy typechecker for Insanely Dependent Types☆91Oct 15, 2025Updated last year
- ☆17Jun 10, 2022Updated 4 years ago
- Experiments with higher-order abstract syntax in Agda☆23Jul 14, 2022Updated 4 years ago
- Experiments with preordered set models of (directed) type theories☆16Jul 10, 2019Updated 7 years ago
- Experiments with Realizability in Univalent Type Theory☆20Oct 21, 2024Updated 2 years ago
- GPUs on demand by Runpod - Special Offer Available • AdRun AI, ML, and HPC workloads on powerful cloud GPUs—without limits or wasted spend. Deploy GPUs in under a minute and pay by the second.
- ☆17Apr 4, 2024Updated 2 years ago
- System benchmarking for proof assistants☆16May 9, 2026Updated 5 months ago
- Multimode simple type theory as an Agda library.☆22Sep 18, 2024Updated 2 years ago
- Normalization by evaluation of simply typed combinators.☆27Feb 24, 2022Updated 4 years ago
- high-performance cubical evaluation☆90Sep 22, 2026Updated last month
- ☆12Mar 13, 2025Updated last year
- ☆14Aug 5, 2026Updated 2 months ago
- A Lean 4 formalization of partial combinatory algebras.☆15Jan 6, 2025Updated last year
- Agda to C compiler☆11Sep 23, 2025Updated last year
- AI Agents on DigitalOcean Gradient AI Platform • AdBuild production-ready AI agents using customizable tools or access multiple LLMs through a single endpoint. Create custom knowledge bases or connect external data.
- Demo for dependent types + runtime code generation☆72Sep 9, 2026Updated last month
- ☆12Jan 2, 2023Updated 3 years ago
- Lean library for typed metaprogramming based on staging, with support for dependent types and reasoning about metaprograms.☆16Sep 25, 2026Updated last month
- A Logical Relation for Martin-Löf Type Theory in Agda☆60Sep 11, 2025Updated last year
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆20Feb 26, 2021Updated 5 years ago
- An English translation of Deligne's three "Hodge theory" papers☆15Sep 21, 2026Updated last month
- An extension of the NbE algorithm to produce computational traces☆22May 5, 2022Updated 4 years ago