zaklogician / typical-antiphrasisLinks
Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
☆40Updated 4 years ago
Alternatives and similar repositories for typical-antiphrasis
Users that are interested in typical-antiphrasis are comparing it to the libraries listed below
Sorting:
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- being a particular fragment of Haskell, extended to a proof system☆38Updated last month
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Setoid type theory implementation☆38Updated 2 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- System F-omega normalization by hereditary substitution in Agda☆60Updated 6 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- Revised Omega-categorical Typechecker☆27Updated 10 months ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 3 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- ☆48Updated last month
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated last year
- Deferring the Details and Deriving Programs☆14Updated 6 years ago
- A verified compiler for a lazy functional language☆37Updated this week
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 10 months ago
- Typing the linear pi calculus in Agda☆29Updated 3 years ago
- Toy typechecker for Insanely Dependent Types☆81Updated 12 years ago
- Paper and talk☆55Updated 2 years ago
- Spartan implementation of H.O.T.T.☆25Updated 3 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 3 months ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 4 months ago
- A tiny language for teaching and experimenting with Refinement Types☆48Updated 4 years ago