RedPRL / mugenLinks
♾️ A library for universe levels and universe polymorphism
☆36Updated 2 months ago
Alternatives and similar repositories for mugen
Users that are interested in mugen are comparing it to the libraries listed below
Sorting:
- high-performance cubical evaluation☆79Updated 9 months ago
- Mechanizations of Type Theories☆33Updated 3 weeks ago
- antifunext☆38Updated last year
- ☆25Updated last year
- ☆38Updated 4 years ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆29Updated 3 weeks ago
- Algebraic proof discovery in Agda☆35Updated 4 years ago
- ☆45Updated 10 months ago
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆15Updated 2 years ago
- Formalization of 2LTT in Agda☆17Updated 6 months ago
- An attempt towards univalent classical mathematics in Cubical Agda.☆32Updated 2 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Updated 4 months ago
- Benchmarking various normalization algorithms for the lambda calculus☆48Updated 3 years ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- A formalization of the theory behind the mugen library☆19Updated last year
- Extensions to cubical for categorical logic/type theory☆35Updated this week
- ☆31Updated 2 years ago
- A cost-aware logical framework, embedded in Agda.☆74Updated 3 months ago
- This aims to be the most pretentious implementation of stlc in existence☆65Updated 3 years ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆48Updated last month
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated 2 months ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆69Updated last year
- Logical Relation for MLTT in Coq☆29Updated 3 weeks ago
- Syntax for Virtual Equipments: a natural syntax for doing synthetic and internal category theory☆32Updated 2 years ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated last week
- my phd thesis☆26Updated last year
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆73Updated this week
- Eventually a practical 2-level TT-based compiler☆31Updated this week
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated 2 years ago
- 🪆 A Staged Type Theory☆35Updated 2 years ago