cofibrant / agda-nbeLinks
Verified NbE via gluing in Agda
☆11Updated last year
Alternatives and similar repositories for agda-nbe
Users that are interested in agda-nbe are comparing it to the libraries listed below
Sorting:
- ☆21Updated 3 years ago
- ☆15Updated last year
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Agda to C compiler☆10Updated last week
- Quasi-quoting library for agda☆18Updated 10 months ago
- Experiments with Realizability in Univalent Type Theory☆19Updated 11 months ago
- my phd thesis☆26Updated last year
- ☆11Updated 5 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 3 months ago
- a version of the 2048 game for Coq☆22Updated last year
- ☆17Updated 3 years ago
- ☆18Updated 3 years ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Meta-theory and normalization for Fitch-style modal lambda calculi☆19Updated last year
- Algebraic proof discovery in Agda☆34Updated 3 years ago
- Coherence typechecker for infinity categories☆20Updated 3 weeks ago
- being a particular fragment of Haskell, extended to a proof system☆39Updated 2 months ago
- Experimenting on ornamentation in Agda via reflection.☆12Updated 2 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 6 months ago
- ☆23Updated last year
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆14Updated last year
- Mtac in Agda☆28Updated 4 years ago
- Revised Omega-categorical Typechecker☆27Updated 11 months ago
- ☆29Updated 3 years ago
- Mechanizations of Type Theories☆32Updated last month
- Research material of Erik Palmgren (1963–2019)☆21Updated 5 months 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
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- Extensions to cubical for categorical logic/type theory☆32Updated this week