FrozenWinters / SbELinks
An extension of the NbE algorithm to produce computational traces
☆22Updated 3 years ago
Alternatives and similar repositories for SbE
Users that are interested in SbE are comparing it to the libraries listed below
Sorting:
- Quasi-quoting library for agda☆17Updated 6 months ago
- Meta-theory and normalization for Fitch-style modal lambda calculi☆18Updated last year
- ☆29Updated 2 years ago
- A formalization of the theory behind the mugen library☆19Updated 11 months ago
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆13Updated last year
- Correctness of normalization-by-evaluation for STLC☆22Updated 5 years ago
- ☆21Updated 3 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- ModTT in Agda☆11Updated 3 years ago
- my phd thesis☆26Updated 9 months ago
- Syntax for Virtual Equipments: a natural syntax for doing synthetic and internal category theory☆32Updated 2 years ago
- Repository holding code and latex sources for paper "Why Not W?"☆11Updated 4 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Notes (and implementation) of unification with binders☆14Updated 2 weeks ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 4 months ago
- ☆15Updated last year
- Mechanizations of Type Theories☆29Updated 3 months ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆17Updated 4 years ago
- ☆23Updated 11 months ago
- ☆29Updated 2 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- An attempt towards univalent classical mathematics in Cubical Agda.☆29Updated last year
- Algebraic proof discovery in Agda☆33Updated 3 years ago
- ☆11Updated 4 years ago
- Typing the linear pi calculus in Agda☆29Updated 3 years ago
- Haskell implementation of the Edinburgh Logical Framework☆28Updated 3 weeks ago
- ☆19Updated 3 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
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- Higher Algebra with Opetopic Types☆15Updated 2 years ago