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☆34Updated last month
- Generalized syntax & semantics for universe hierarchies☆31Updated 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
- System F-omega normalization by hereditary substitution in Agda☆60Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 4 months ago
- A type theory with native support for Polynomial Functors.☆39Updated last year
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- Toy typechecker for Insanely Dependent Types☆81Updated 12 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Revised Omega-categorical Typechecker☆27Updated 10 months ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Spartan implementation of H.O.T.T.☆25Updated 3 years ago
- Setoid type theory implementation☆38Updated 2 years ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 11 months ago
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆22Updated 8 years ago
- A simple supercompiler formally verified in Agda☆34Updated 8 years ago
- being bits and pieces I'm inclined to leave lying around☆53Updated 2 months ago
- ☆48Updated 3 weeks ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 2 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 5 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- A showcase of interesting code and proof developments in Cedille☆36Updated 3 months ago
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- Where my everyday research happens☆55Updated 2 months ago
- A tiny language for teaching and experimenting with Refinement Types☆48Updated 4 years ago