L-TChen / FiniteSetsLinks
Fintie Sets in Cubical Agda
☆12Updated 5 years ago
Alternatives and similar repositories for FiniteSets
Users that are interested in FiniteSets are comparing it to the libraries listed below
Sorting:
- ☆18Updated 3 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated last month
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Mtac in Agda☆28Updated 4 years ago
- Quasi-quoting library for agda☆18Updated 8 months ago
- my phd thesis☆26Updated last year
- IO using sized types and copatterns☆35Updated 4 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
- Multimode simple type theory as an Agda library.☆23Updated 11 months ago
- ☆21Updated 3 years ago
- ☆11Updated 5 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Experiments with Realizability in Univalent Type Theory☆18Updated 10 months ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- a version of the 2048 game for Coq☆22Updated last year
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 5 months ago
- Verified NbE via gluing in Agda☆11Updated last year
- Experimenting on ornamentation in Agda via reflection.☆12Updated 2 years ago
- ☆21Updated 3 years ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆19Updated 4 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 3 months ago
- ☆15Updated last year
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 4 years ago
- ☆17Updated 6 years ago