gergoerdi / universe-of-syntaxLinks
A universe of scope- and type-safe syntaxes (syntices?). Includes generic implementation of type-preserving renaming/substitution with all the proofs you could possibly need.
☆16Updated 7 years ago
Alternatives and similar repositories for universe-of-syntax
Users that are interested in universe-of-syntax are comparing it to the libraries listed below
Sorting:
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- Mtac in Agda☆28Updated 4 years ago
- My master thesis about generic programming and ornaments☆16Updated 9 years ago
- Formalizing nbe in agda☆31Updated 12 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- Category theory and algebra☆27Updated 9 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Resources for "One Monad to Prove Them All"☆29Updated 6 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Formalizations of strong normalization proofs☆35Updated 6 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 9 months ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- Bindings to Haskell's IO monad which respect Agda's semantics☆24Updated 6 years ago
- Hakyll support for Agda literate files☆19Updated 4 years ago
- Relative Monad Library for Agda☆24Updated 6 years ago
- ☆20Updated last year
- An abstract machine using indexed containers and their zippers☆14Updated 8 years ago
- ☆32Updated 7 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- ☆23Updated 8 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated last month
- STLC-related snippets in Agda☆16Updated 12 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago