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
- Spartan implementation of H.O.T.T.☆25Updated 3 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 2 months ago
- my phd thesis☆26Updated last year
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆14Updated last year
- Category theory formalized in cubical agda☆21Updated 5 years ago
- ☆48Updated 3 weeks ago
- Setoid type theory implementation☆38Updated 2 years ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- Correctness of normalization-by-evaluation for STLC☆23Updated 5 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- being bits and pieces I'm inclined to leave lying around☆53Updated 2 months ago
- A library for doing generic programming in Agda☆34Updated 4 years ago
- Multimode simple type theory as an Agda library.☆23Updated 11 months ago
- NbE course @ Chalmers☆28Updated 11 months ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago
- being a particular fragment of Haskell, extended to a proof system☆34Updated last month
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 4 months ago
- Compiler backend for generating Scheme code☆26Updated last year
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- Meta-theory and normalization for Fitch-style modal lambda calculi☆19Updated last year
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- ☆23Updated 2 months ago
- ☆29Updated 3 years ago
- Eventually a practical 2-level TT-based compiler☆27Updated last month
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- A formalization of the theory behind the mugen library☆19Updated last year
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago