dpndnt / libraryLinks
Library of the ##dependent distributed research support group
☆115Updated last year
Alternatives and similar repositories for library
Users that are interested in library are comparing it to the libraries listed below
Sorting:
- A small implementation of higher-order unification☆189Updated 7 years ago
- The theory of algebraic graphs formalised in Agda☆90Updated 7 years ago
- Organization and planning for the Initial Types Club☆73Updated 2 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆100Updated 9 months ago
- SPLV20 course notes☆112Updated 2 years ago
- Strongly-typed System F in Haskell☆118Updated 2 years ago
- Total Parser Combinators in Agda☆131Updated 2 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆74Updated 3 years ago
- ICFP 2020 papers. Crowd-sourced☆91Updated 5 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Normalization by Evaluation for Martin-Löf Type Theory☆128Updated last year
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated last week
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆124Updated last year
- being the teaching materials and exercises for CS410 in the 2018/19 session☆57Updated 6 years ago
- Hypertypes - generic programming for heterogeneous recursive types☆125Updated 6 months ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- Programming library for Agda☆130Updated 11 months ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆103Updated 3 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- Benchmarks for capture-avoiding substitution☆119Updated 2 months ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆75Updated 7 years ago
- being the materials for Summer 2013's course☆112Updated 2 years ago
- GHC Whole Program Compiler and External STG IR tooling☆118Updated 8 months ago
- An implementation of Pie in Haskell☆205Updated 5 years ago
- 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
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 4 years ago
- What I wish I knew when learning HoTT☆53Updated 6 years ago