gergoerdi / universe-of-syntaxView external linksLinks
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.
☆16Dec 10, 2017Updated 8 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:
- ☆20Aug 13, 2024Updated last year
- Experiments with effect systems☆12Apr 18, 2016Updated 9 years ago
- Category Theory in Agda☆13Jan 16, 2018Updated 8 years ago
- STLC-related snippets in Agda☆16May 1, 2013Updated 12 years ago
- Agda suffices: software written from A to Z in Agda☆16Mar 31, 2019Updated 6 years ago
- Observational Type Theory as an Agda library☆57May 27, 2017Updated 8 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Aug 31, 2019Updated 6 years ago
- Constructive definition of real numbers implemented in agda.☆10Jul 31, 2016Updated 9 years ago
- Mtac in Agda☆29May 4, 2021Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Jan 11, 2019Updated 7 years ago
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Sep 6, 2017Updated 8 years ago
- A library for doing generic programming in Agda☆36Jan 27, 2021Updated 5 years ago
- Machine-checked Agda formalization for the ILC project☆15Apr 6, 2018Updated 7 years ago
- My Agda experiments☆12Sep 26, 2019Updated 6 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Jan 17, 2020Updated 6 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆28Jul 3, 2025Updated 7 months ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Mar 5, 2022Updated 3 years ago
- Control.Effects☆19Apr 14, 2019Updated 6 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Apr 29, 2022Updated 3 years ago
- Dependently typed Algorithm M and friends☆26Jun 2, 2018Updated 7 years ago
- My attempt to better understand both Coq and Category Theory by formalizing the latter in the former.☆14Aug 3, 2019Updated 6 years ago
- "operating system" based on the calculus of constructions☆18Jun 22, 2022Updated 3 years ago
- The theory of algebraic graphs formalised in Agda☆91Jul 15, 2018Updated 7 years ago
- Invertible parsing for S-expressions☆34Feb 4, 2026Updated 2 weeks ago
- Code for tutorials, papers and experiments. Mostly Agda, Coq and Haskell.☆21Feb 17, 2023Updated 3 years ago
- Experiments with preordered set models of (directed) type theories☆15Jul 10, 2019Updated 6 years ago
- Interpreter for functional pure type systems.☆21Jun 30, 2017Updated 8 years ago
- NbE course @ Chalmers☆28Sep 24, 2024Updated last year
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Nov 24, 2021Updated 4 years ago
- secret project☆17Mar 14, 2018Updated 7 years ago
- A simple functional programming language.☆22Jun 3, 2021Updated 4 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Jan 30, 2024Updated 2 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Jul 24, 2019Updated 6 years ago
- Tiny type-checker with dependent types☆78Jan 8, 2014Updated 12 years ago
- wherein I implement several substructural logics in Agda☆24Oct 8, 2018Updated 7 years ago
- Dependently typed programming language written in Haskell☆22Feb 14, 2022Updated 4 years ago
- Agda formalisation of NbE for λ□☆18Dec 5, 2017Updated 8 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34May 27, 2017Updated 8 years ago