zaklogician / typical-antiphrasisLinks
Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
☆41Updated 5 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
- being a particular fragment of Haskell, extended to a proof system☆42Updated last week
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Generalized syntax & semantics for universe hierarchies☆32Updated last year
- IO using sized types and copatterns☆36Updated 4 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- A verified compiler for a lazy functional language☆36Updated last week
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- Where my everyday research happens☆55Updated last week
- Minimalistic dependent type theory with syntactic metaprogramming☆58Updated last year
- A showcase of interesting code and proof developments in Cedille☆36Updated 5 months ago
- # A simple variable binding library based on well-scoped indices and environments☆27Updated last month
- being bits and pieces I'm inclined to leave lying around☆54Updated 5 months ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- System F-omega normalization by hereditary substitution in Agda☆61Updated 6 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆23Updated 8 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- Algebraic proof discovery in Agda☆35Updated 3 years ago
- Paper and talk☆55Updated 2 years ago
- Revised Omega-categorical Typechecker☆27Updated last year
- A Unifying Cartesian Cubical Set Model☆34Updated 6 years ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated last year
- Formalizing nbe in agda☆32Updated 13 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 5 years ago
- Setoid type theory implementation☆38Updated 2 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated 2 years ago