gergoerdi / universe-of-syntax
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
- My master thesis about generic programming and ornaments☆16Updated 8 years ago
- A library for doing generic programming in Agda☆31Updated 4 years ago
- Mtac in Agda☆28Updated 3 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 4 months ago
- Dependently typed Algorithm M and friends☆25Updated 6 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- Observational Type Theory as an Agda library☆52Updated 7 years ago
- Formalizing nbe in agda☆30Updated 12 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Category theory and algebra☆28Updated 8 years ago
- Type-Theory in Sequent Calculus☆13Updated 9 years ago
- IO using sized types and copatterns☆33Updated 4 years ago
- An abstract machine using indexed containers and their zippers☆14Updated 8 years ago
- Formalizations of strong normalization proofs☆35Updated 5 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆72Updated 3 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- ☆30Updated 6 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 3 months ago
- Agda suffices: software written from A to Z in Agda☆15Updated 6 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- Benchmarking tool for compile-time performance of Agda programs☆18Updated 3 years ago
- Session Types with Priority in Linear Haskell☆26Updated 10 months ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 3 years ago
- Dependently typed elimination functions using singletons☆28Updated 3 months ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 8 years ago
- A dependently typed type checker for a TT with intervals☆22Updated 5 years ago
- Type Theory with Indexed Equality☆25Updated 8 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago