JorisCeulemans / sikkelLinks
Multimode simple type theory as an Agda library.
☆23Updated last year
Alternatives and similar repositories for sikkel
Users that are interested in sikkel are comparing it to the libraries listed below
Sorting:
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Mtac in Agda☆28Updated 4 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 3 months ago
- ☆18Updated 3 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 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 3 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- ☆21Updated 3 years ago
- Correctness of normalization-by-evaluation for STLC☆23Updated 6 years ago
- Meta-theory and normalization for Fitch-style modal lambda calculi☆19Updated last year
- Quasi-quoting library for agda☆18Updated 10 months ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 5 months ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- Agda to C compiler☆10Updated 2 weeks ago
- my phd thesis☆26Updated last year
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- ☆17Updated 3 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- Revised Omega-categorical Typechecker☆27Updated 11 months ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- ☆29Updated 3 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- Fintie Sets in Cubical Agda☆12Updated 6 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 3 months ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 3 weeks ago
- ☆17Updated 6 years ago
- Intrinsic Verification of Formal Grammar Theory☆26Updated 2 months ago
- Compiler backend for generating Scheme code☆26Updated last year