andrejbauer / clerical
Command-like expressions for real infinite-precision calculations
☆42Updated last year
Alternatives and similar repositories for clerical:
Users that are interested in clerical are comparing it to the libraries listed below
- A verified compiler for a lazy functional language☆34Updated 3 weeks ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated 5 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆49Updated 5 months ago
- ☆36Updated 3 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- ☆29Updated 2 years ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 5 months ago
- Agda formalisation of second-order abstract syntax☆54Updated 2 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆28Updated 3 years ago
- An attempt towards univalent classical mathematics in Cubical Agda.☆29Updated last year
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- Algebraic proof discovery in Agda☆32Updated 3 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆35Updated last year
- IO using sized types and copatterns☆33Updated 3 years ago
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- A formalization of the theory behind the mugen library☆19Updated 8 months ago
- A Unifying Cartesian Cubical Set Model☆35Updated 5 years ago
- 🪆 A Staged Type Theory☆35Updated last year
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- Session types in Idris2!☆27Updated 4 years ago
- LL(1) parser generator verified in Coq☆45Updated 5 years ago
- Mechanizations of Type Theories☆28Updated 2 weeks ago
- Lambda normalization and conversion checking benchmarks for various implementations☆54Updated 3 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆25Updated 2 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆44Updated 2 years ago
- Anders: Cubical Type Checker☆23Updated last year
- An enhanced unification algorithm for Coq☆54Updated last week
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago