Command-like expressions for real infinite-precision calculations
☆55Aug 5, 2025Updated 6 months ago
Alternatives and similar repositories for clerical
Users that are interested in clerical are comparing it to the libraries listed below
Sorting:
- A formalization of Pure Type Systems (PTS) in Agda☆28Jul 3, 2025Updated 8 months ago
- An attempt towards univalent classical mathematics in Cubical Agda.☆32Sep 15, 2023Updated 2 years ago
- IO using sized types and copatterns☆36Apr 14, 2021Updated 4 years ago
- Experimental normalisation via scheme☆12Jul 25, 2021Updated 4 years ago
- ☆21Jan 24, 2022Updated 4 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Nov 21, 2025Updated 3 months ago
- Experiments with preordered set models of (directed) type theories☆15Jul 10, 2019Updated 6 years ago
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆22Nov 20, 2025Updated 3 months ago
- Experimental type-checker for internally parametric type theory☆32Mar 27, 2025Updated 11 months ago
- An enhanced unification algorithm for Coq☆59Jan 30, 2026Updated last month
- Intrinsic Verification of Formal Grammar Theory☆27Nov 22, 2025Updated 3 months ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Jun 13, 2024Updated last year
- Experiments in Synthetic Differential Geometry☆16Jul 1, 2021Updated 4 years ago
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- An experimental type checker for a modal dependent type theory.☆116May 9, 2020Updated 5 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆60Jun 18, 2024Updated last year
- ☆18May 10, 2022Updated 3 years ago
- Groupoids vs 1-Types☆11Nov 8, 2018Updated 7 years ago
- Observational Type Theory as an Agda library☆57May 27, 2017Updated 8 years ago
- 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 library for universe levels and universe polymorphism☆37Nov 21, 2025Updated 3 months ago
- ☆16Dec 28, 2021Updated 4 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆20Feb 26, 2021Updated 5 years ago
- Tiny verified SAT-solver☆30Jan 7, 2022Updated 4 years ago
- Mechanizations of Type Theories☆35Jan 15, 2026Updated last month
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆86Sep 13, 2021Updated 4 years ago
- Generalized syntax & semantics for universe hierarchies☆32Dec 11, 2023Updated 2 years ago
- An infinity-categorical coherence typechecker☆18Nov 4, 2024Updated last year
- OCaml implementation of DSub, a ML like language with subtyping and path dependent types.☆13Apr 18, 2017Updated 8 years ago
- Linearizability Hoare Logic☆17Feb 9, 2026Updated 3 weeks ago
- A small NuPRL style proof assistant☆31Jan 31, 2019Updated 7 years ago
- Code for "Staged Generic Programming" (ICFP 2017)☆28Sep 2, 2023Updated 2 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Sep 11, 2025Updated 5 months ago
- "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory☆215Mar 25, 2022Updated 3 years ago
- Total Parser Combinators in Agda☆133Aug 5, 2025Updated 6 months ago
- Setoid type theory implementation☆38Aug 24, 2023Updated 2 years ago
- A Model of Relationally Parametric System F in Coq☆22May 27, 2015Updated 10 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆133Jun 5, 2024Updated last year