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
- Setoid type theory implementation☆38Updated 2 years ago
- my phd thesis☆26Updated last year
- Meta-theory and normalization for Fitch-style modal lambda calculi☆19Updated last year
- Multimode simple type theory as an Agda library.☆23Updated last year
- ☆51Updated 4 months ago
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆15Updated last year
- Quasi-quoting library for agda☆18Updated last year
- Correctness of normalization-by-evaluation for STLC☆24Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 7 months ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 5 months ago
- Generalized syntax & semantics for universe hierarchies☆32Updated 2 years ago
- Organize mathematical thoughts☆20Updated 2 years ago
- Extensions to cubical for categorical logic/type theory☆34Updated last week
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 4 years ago
- ☆15Updated 2 years ago
- Compiler backend for generating Scheme code☆28Updated 3 weeks ago
- ☆25Updated last year
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago
- Benchmarking tool for compile-time performance of Agda programs☆19Updated 3 years ago
- Algebraic proof discovery in Agda☆35Updated 4 years ago
- NbE course @ Chalmers☆28Updated last year
- Category theory formalized in cubical agda☆21Updated 5 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated 2 years ago
- being a particular fragment of Haskell, extended to a proof system☆42Updated 3 weeks ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- ☆31Updated 2 years ago