L-TChen / FiniteSets
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
- ☆18Updated 2 years ago
- ☆11Updated 4 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 2 months ago
- IO using sized types and copatterns☆33Updated 3 years ago
- ☆18Updated 3 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 5 months 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
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- ☆17Updated 6 years ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- Mtac in Agda☆28Updated 3 years ago
- Repository holding code and latex sources for paper "Why Not W?"☆11Updated 4 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Quasi-quoting library for agda☆17Updated 3 months ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 11 years ago
- Agda code for experimenting with internal models of cubical type theory☆13Updated 6 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 6 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated 3 months ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆17Updated 4 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- Higher Algebra with Opetopic Types☆14Updated last year
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Desc'n crunch: Descriptions, levitation, and reflecting the elaborator.☆11Updated 6 years ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- ☆23Updated 8 months ago