dpndnt / libraryLinks
Library of the ##dependent distributed research support group
☆117Updated last year
Alternatives and similar repositories for library
Users that are interested in library are comparing it to the libraries listed below
Sorting:
- The theory of algebraic graphs formalised in Agda☆91Updated 7 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆72Updated 6 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆128Updated last year
- Agda bindings to SMT-LIB2 compatible solvers.☆102Updated last month
- A small implementation of higher-order unification☆190Updated 8 years ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆103Updated 3 years ago
- Organization and planning for the Initial Types Club☆73Updated 2 years ago
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- SPLV20 course notes☆112Updated 2 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- Programming library for Agda☆130Updated last year
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated last month
- Benchmarks for capture-avoiding substitution☆119Updated 3 months ago
- ICFP 2020 papers. Crowd-sourced☆91Updated 5 years 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
- What I wish I knew when learning HoTT☆53Updated 6 years ago
- Utilities and documentation for exploring idirs2's new elaborator reflection.☆83Updated 3 weeks ago
- Hypertypes - generic programming for heterogeneous recursive types☆125Updated 7 months ago
- An implementation of Pie in Haskell☆209Updated 5 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …☆110Updated 6 years ago
- Total Parser Combinators in Agda☆132Updated last month
- Strongly-typed System F in Haskell☆118Updated 2 years ago
- A prototypical dependently typed languages with sized types and variances☆111Updated last month
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆124Updated last year
- Unification and type inference algorithms☆125Updated 10 years ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆75Updated 7 years ago
- A workshop on learning Agda with minimal prerequisites.☆85Updated 9 years ago
- A tutorial on how Agda infers things☆61Updated 2 months ago