artagnon / bonakLinks
π§ An indexed construction of semi-simplicial and semi-cubical sets
β30Updated this week
Alternatives and similar repositories for bonak
Users that are interested in bonak are comparing it to the libraries listed below
Sorting:
- Toy implementation of Martin-LΓΆf Type Theoryβ30Updated 3 years ago
- A type theory with native support for Polynomial Functors.β39Updated last year
- Generalized syntax & semantics for universe hierarchiesβ31Updated last year
- β36Updated 3 years ago
- Organize mathematical thoughtsβ20Updated last year
- being an implementation of the calculus of constructionsβ17Updated 2 years ago
- Revised Omega-categorical Typecheckerβ27Updated 10 months ago
- A Unifying Cartesian Cubical Set Modelβ34Updated 5 years ago
- A formalization of System FΟ in Agdaβ19Updated 6 months ago
- Work in progress on semi-simplicial typesβ23Updated 2 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the packβ¦β28Updated 6 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Genericallyβ21Updated last year
- Experimental proof assistant (and architecture) for dependent linear logicβ49Updated 3 years ago
- IO for Gallinaβ33Updated 2 months ago
- πͺ A Staged Type Theoryβ35Updated 2 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.β83Updated 3 years ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.β15Updated last year
- being bits and pieces I'm inclined to leave lying aroundβ53Updated 2 months ago
- my phd thesisβ26Updated last year
- Spartan implementation of H.O.T.T.β25Updated 3 years ago
- An attempt towards univalent classical mathematics in Cubical Agda.β32Updated last year
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.β22Updated 4 months ago
- A simple supercompiler formally verified in Agdaβ34Updated 8 years ago
- Simply-typed lambda calculus as a QIT in cubical Agda + normalizationβ14Updated last year
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agdaβ76Updated 2 weeks ago
- Typing the linear pi calculus in Agdaβ29Updated 3 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of unβ¦β20Updated 3 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.β40Updated 4 years ago
- being a particular fragment of Haskell, extended to a proof systemβ34Updated last month
- A formalization of the theory behind the mugen libraryβ19Updated last year