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☆36Updated 6 years ago
- Mtac in Agda☆29Updated 4 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 11 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 7 months ago
- ☆18Updated 3 years ago
- Correctness of normalization-by-evaluation for STLC☆24Updated 6 years ago
- Quasi-quoting library for agda☆18Updated last year
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 3 months ago
- Meta-theory and normalization for Fitch-style modal lambda calculi☆19Updated last year
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 2 months ago
- ☆21Updated 4 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- my phd thesis☆26Updated last year
- 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
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Generalized syntax & semantics for universe hierarchies☆32Updated 2 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Formalizations of strong normalization proofs☆35Updated 6 years ago
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆15Updated 2 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated 2 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated 2 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Haskell implementation of the Edinburgh Logical Framework☆32Updated last month
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 6 years ago
- Revised Omega-categorical Typechecker☆27Updated last year
- ☆15Updated 2 years ago
- ☆21Updated 4 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Updated 5 months ago