roglo / banach_tarskiLinks
Formal proof in Coq of Banach-Tarski paradox.
☆16Updated 2 months ago
Alternatives and similar repositories for banach_tarski
Users that are interested in banach_tarski are comparing it to the libraries listed below
Sorting:
- Logical relations proof in Agda☆27Updated 10 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Reflection library for Coq☆12Updated 5 years ago
- Library of Unix effects for Coq.☆24Updated 5 years ago
- All the code I've ever written in Ltac2☆11Updated 4 years ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 6 years ago
- SubML (prototype) language☆23Updated 3 years ago
- System F in coq.☆19Updated 10 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- Category theory and algebra☆28Updated 8 years ago
- Observational Type Theory as an Agda library☆53Updated 8 years ago
- F-omega with interval kinds mechanized in Agda☆13Updated 11 months ago
- Examples from our paper "Capturing the Future by Replaying the Past"☆21Updated 10 months ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Example Coq plugin☆17Updated 7 years ago
- Coherence typechecker for Grothendieck/Maltsiniotis style infinity categories☆15Updated 8 years ago
- ☆27Updated 5 years ago
- OCaml backend for Agda☆40Updated 6 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- MPRI-2.4 Dependently-typed Functional Programming☆32Updated 4 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- Formalizations of strong normalization proofs☆35Updated 6 years ago
- flexible 'let rec' generation for MetaOCaml☆26Updated last month
- Haskell implementation of the Edinburgh Logical Framework☆30Updated 2 months ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago