TOTBWF / teenyttLinks
A Teeny Type Theory
☆27Updated 3 years ago
Alternatives and similar repositories for teenytt
Users that are interested in teenytt are comparing it to the libraries listed below
Sorting:
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 3 months ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago
- being a particular fragment of Haskell, extended to a proof system☆42Updated 2 months ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Multimode simple type theory as an Agda library.☆23Updated last year
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 5 months ago
- Correctness of normalization-by-evaluation for STLC☆23Updated 6 years ago
- classical sequent calculus, embedded in Haskell☆21Updated 2 months ago
- Compiler backend for generating Scheme code☆27Updated last year
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- IO using sized types and copatterns☆36Updated 4 years ago
- ☆49Updated 2 months ago
- NbE course @ Chalmers☆28Updated last year
- Setoid type theory implementation☆38Updated 2 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Benchmarking tool for compile-time performance of Agda programs☆19Updated 3 years ago
- Category theory formalized in cubical agda☆21Updated 5 years ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- A library for doing generic programming in Agda☆34Updated 4 years ago
- Mtac in Agda☆28Updated 4 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- Meta-theory and normalization for Fitch-style modal lambda calculi☆19Updated last year
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated last year
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- ☆24Updated 3 months ago
- Eventually a practical 2-level TT-based compiler☆28Updated last week
- being bits and pieces I'm inclined to leave lying around☆54Updated 3 months ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated last year