scmu / aopaLinks
Algebra of Programming in Agda: Dependent Types for Relational Program Derivation
☆83Updated 9 years ago
Alternatives and similar repositories for aopa
Users that are interested in aopa are comparing it to the libraries listed below
Sorting:
- ☆84Updated 8 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- apkg - package manager for Agda☆38Updated 4 years ago
- The theory of algebraic graphs formalised in Agda☆91Updated 7 years ago
- A prototypical dependently typed languages with sized types and variances☆111Updated last month
- Programming library for Agda☆130Updated last year
- Normalization by Evaluation for Martin-Löf Type Theory☆129Updated last year
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- The Iowa Agda Library☆49Updated 2 months ago
- Summer school on programming in Agda☆68Updated 2 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆76Updated 2 weeks ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 3 years ago
- Formalizations of Gradually Typed Languages in Agda☆57Updated 7 months ago
- being the materials for Summer 2013's course☆112Updated 2 years ago
- HoTT in Lean 3☆81Updated 5 years ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆75Updated 7 years ago
- Where my everyday research happens☆55Updated 3 months ago
- What I wish I knew when learning HoTT☆53Updated 6 years ago
- Benchmarks for capture-avoiding substitution☆119Updated 3 months ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- A formalization of category theory in cubical Agda☆59Updated 5 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- Notes and handouts from OPLSS 2018☆55Updated 7 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆102Updated last month
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated last month
- Toy typechecker for Insanely Dependent Types☆81Updated 12 years ago
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago