andrejbauer / clericalLinks
Command-like expressions for real infinite-precision calculations
☆55Updated 5 months ago
Alternatives and similar repositories for clerical
Users that are interested in clerical are comparing it to the libraries listed below
Sorting:
- A verified compiler for a lazy functional language☆37Updated this week
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated last month
- A formalization of System Fω in Agda☆20Updated 2 weeks ago
- A Unifying Cartesian Cubical Set Model☆35Updated 6 years ago
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- ☆36Updated 4 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- An implementation of a simple Neural network in Idris using category theory.☆24Updated last year
- An enhanced unification algorithm for Coq☆58Updated last month
- Work in progress on semi-simplicial types☆23Updated 3 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- # A simple variable binding library based on well-scoped indices and environments☆28Updated 2 months ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆30Updated last week
- Generalized syntax & semantics for universe hierarchies☆32Updated 2 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- A proof tree viewer that works with Coq through Proof General☆28Updated 4 years ago
- A formalization of the theory behind the mugen library☆19Updated last year
- A simple implementation of XTT, "A cubical language for Bishop sets"☆27Updated 3 years ago
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆15Updated last year
- An attempt towards univalent classical mathematics in Cubical Agda.☆32Updated 2 years ago
- ☆17Updated last year
- Anders: Cubical Type Checker☆23Updated 2 years ago
- Setoid type theory implementation☆38Updated 2 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- being a particular fragment of Haskell, extended to a proof system☆43Updated last month
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 6 months ago
- Experimental type-checker for internally parametric type theory☆32Updated 9 months ago
- IO using sized types and copatterns☆36Updated 4 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated 2 months ago