GuillermoCalderon / ProjectiveGeometryInAgda
A formalization of Constructive Projective Geometry in Agda
☆12Updated 5 years ago
Related projects: ⓘ
- Agda code for experimenting with internal models of cubical type theory☆13Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated 5 months ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 6 years ago
- ☆11Updated 4 years ago
- ☆23Updated this week
- Mtac in Agda☆28Updated 3 years ago
- Organize mathematical thoughts☆19Updated 11 months ago
- Self-contained repository for the eponymous paper☆29Updated 5 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated 5 months ago
- ☆21Updated 2 months ago
- Generalized syntax & semantics for universe hierarchies☆28Updated 9 months ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- Benchmarking tool for compile-time performance of Agda programs☆18Updated 2 years ago
- Experiments in Synthetic Differential Geometry☆15Updated 3 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆44Updated this week
- ☆18Updated 2 years ago
- A library for doing generic programming in Agda☆28Updated 3 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- being a particular fragment of Haskell, extended to a proof system☆18Updated 3 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 6 years ago
- ☆26Updated last year
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆33Updated 5 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated 10 months ago
- ☆17Updated 2 years ago
- Repository holding code and latex sources for paper "Why Not W?"☆11Updated 3 years ago
- ☆28Updated 2 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Compiler backend for generating Scheme code☆25Updated 9 months ago
- Coherence typechecker for infinity categories☆17Updated this week
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 7 years ago