andrejbauer / clericalLinks
Command-like expressions for real infinite-precision calculations
☆55Updated 2 months ago
Alternatives and similar repositories for clerical
Users that are interested in clerical are comparing it to the libraries listed below
Sorting:
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated 2 months ago
- A Unifying Cartesian Cubical Set Model☆34Updated 6 years ago
- ☆36Updated 4 years ago
- An attempt towards univalent classical mathematics in Cubical Agda.☆32Updated 2 years ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated last year
- A verified compiler for a lazy functional language☆37Updated last week
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆30Updated last week
- An enhanced unification algorithm for Coq☆58Updated 6 months ago
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- A proof tree viewer that works with Coq through Proof General☆28Updated 4 years ago
- Anders: Cubical Type Checker☆23Updated 2 years ago
- A simple implementation of XTT, "A cubical language for Bishop sets"☆27Updated 3 years ago
- A formalization of the theory behind the mugen library☆19Updated last year
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- System F-omega normalization by hereditary substitution in Agda☆60Updated 6 years ago
- # A simple variable binding library based on well-scoped indices and environments☆27Updated 2 weeks ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 7 months ago
- A cost-aware logical framework, embedded in Agda.☆67Updated this week
- A type theory with native support for Polynomial Functors.☆39Updated 2 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- A formalization of System Fω in Agda☆19Updated 8 months ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Revised Omega-categorical Typechecker☆27Updated last year
- A Coq to Cedille compiler written in Coq☆34Updated 5 years ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆19Updated 4 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 4 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆58Updated last year