L-TChen / FiniteSetsLinks
Fintie Sets in Cubical Agda
☆12Updated 6 years ago
Alternatives and similar repositories for FiniteSets
Users that are interested in FiniteSets are comparing it to the libraries listed below
Sorting:
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 3 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- ☆18Updated 3 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- Quasi-quoting library for agda☆18Updated 10 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
- Mtac in Agda☆28Updated 4 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 5 months ago
- my phd thesis☆26Updated last year
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- ☆11Updated 5 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- ☆21Updated 3 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated 3 weeks ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- ☆16Updated 3 years ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- ☆17Updated 6 years ago
- Verified NbE via gluing in Agda☆11Updated last year
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 3 months ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated last year
- Multimode simple type theory as an Agda library.☆23Updated last year
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆19Updated 4 years ago
- A bare-bones LCF-style proof assistant☆24Updated 6 years ago
- Relative Monad Library for Agda☆24Updated 6 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Experimental normalisation via scheme☆12Updated 4 years ago