maxsnew / grammars-and-semantic-actionsLinks
Intrinsic Verification of Formal Grammar Theory
☆27Updated last week
Alternatives and similar repositories for grammars-and-semantic-actions
Users that are interested in grammars-and-semantic-actions are comparing it to the libraries listed below
Sorting:
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆19Updated 4 years ago
- A formalization of the theory behind the mugen library☆19Updated last year
- Experiment with synthetic domain theory in cubical agda☆14Updated 3 years ago
- Syntax for Virtual Equipments: a natural syntax for doing synthetic and internal category theory☆32Updated 2 years ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 7 months ago
- ☆18Updated 3 years ago
- A type theory with native support for Polynomial Functors.☆40Updated 2 years ago
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆15Updated last year
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 4 months ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆36Updated 3 months ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated last year
- Quasi-quoting library for agda☆18Updated 11 months ago
- Multimode simple type theory as an Agda library.☆23Updated last year
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- ☆17Updated 7 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
- formalization of an equivariant cartesian cubical set model of type theory☆20Updated 10 months ago
- A Unifying Cartesian Cubical Set Model☆34Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 6 months ago
- A style guide for Coq☆18Updated 3 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- Meta-theory and normalization for Fitch-style modal lambda calculi☆19Updated last year
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆21Updated last year
- ☆21Updated 4 years ago
- my phd thesis☆26Updated last year
- ☆17Updated 3 years ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆29Updated this week