algebraic typechecking and elaboration of type systems
☆13Jan 25, 2025Updated last year
Alternatives and similar repositories for faeth
Users that are interested in faeth are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Experimenting on ornamentation in Agda via reflection.☆12Jul 1, 2023Updated 3 years ago
- Code and Materials for an interactive online course on Logic (part of Strathclyde's CS208 Logic and Algorithms module)☆15Updated this week
- a compiler from a lambda language to an assembly language, as a rewrite system☆16Sep 23, 2025Updated last year
- 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
- ☆16Mar 11, 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.
- ☆14Nov 23, 2016Updated 9 years ago
- ☆17Jun 10, 2022Updated 4 years ago
- A simple demonstration of the Agda Reflection API☆12Apr 3, 2012Updated 14 years ago
- Agda to C compiler☆11Sep 23, 2025Updated last year
- 🦠 Reusable components based on algebraic effects☆55Jun 19, 2026Updated 4 months ago
- Elaboration of cumulative universe hierarchies☆13Oct 26, 2026Updated last week
- Mechanizations of Type Theories☆37Aug 11, 2026Updated 2 months ago
- A formalization of the theory behind the mugen library☆20Jul 5, 2026Updated 4 months ago
- Mtac in Agda☆29May 4, 2021Updated 5 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.
- Tic Tac Toe, formalized in Agda☆25Oct 19, 2021Updated 5 years ago
- Experimental normalisation via scheme☆11Jul 25, 2021Updated 5 years ago
- Examples of divide-and-conquer recursion in Coq, based on our POPL 2023 paper "A Type-Based Approach to Divide-and-Conquer Recursion in C…☆10Dec 16, 2024Updated last year
- Experiment with synthetic domain theory in cubical agda☆16Nov 8, 2022Updated 4 years ago
- ☆10May 20, 2026Updated 5 months ago
- Experiments with Realizability in Univalent Type Theory☆20Oct 21, 2024Updated 2 years ago
- ☆14Aug 5, 2026Updated 3 months ago
- Featherweight C, Executable Semantics: Parser, Type Checker, and Abstract Machine☆29Feb 18, 2021Updated 5 years ago
- A polynomial model of a Martin-Löf type theory + a bit of game semantics☆31Dec 3, 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.
- Create string diagrams with LaTeX!☆14Updated this week
- A work-in-progress structure editor for the cooltt proof assistant.☆18Jul 28, 2022Updated 4 years ago
- Experiments on implementing Dependent Pattern Matching under Normalization by Evaluation setup.☆15Oct 31, 2026Updated last week
- A LaTeX-typeset reproduction of Reynolds' "Types, Abstraction and Parametric Polymorphism"☆38Mar 29, 2026Updated 7 months ago
- 👹 A library for hierarchical names and lexical scoping☆29Jun 19, 2026Updated 4 months ago
- ☆18Updated this week
- Various mechanized proof files for fun.☆17Oct 2, 2026Updated last month
- An implementation of a simple Neural network in Idris using category theory.☆25Sep 18, 2024Updated 2 years ago
- ☆18May 10, 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.
- ReScript bindings for the VS Code API☆13Mar 27, 2026Updated 7 months ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆40Jun 19, 2026Updated 4 months ago
- Distributions of Agda executable compiled into WebAssembly.☆25Apr 4, 2026Updated 7 months ago
- Topos theory in Lean 4☆19Feb 10, 2025Updated last year
- Formalization of 2LTT in Agda☆10Oct 11, 2026Updated 3 weeks ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆20Feb 26, 2021Updated 5 years ago
- HoTT Book formalisations in Rzk.☆24Jun 15, 2026Updated 4 months ago