dpndnt / library
Library of the ##dependent distributed research support group
☆110Updated 3 months ago
Related projects ⓘ
Alternatives and complementary repositories for library
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- The theory of algebraic graphs formalised in Agda☆87Updated 6 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆70Updated 5 years ago
- A small implementation of higher-order unification☆182Updated 7 years ago
- SPLV20 course notes☆106Updated last year
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆122Updated 3 months ago
- A prototypical dependently typed languages with sized types and variances☆104Updated last year
- yacctt: Yet Another Cartesian Cubical Type Theory☆74Updated 6 years ago
- An implementation of Pie in Haskell☆204Updated 5 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆122Updated 5 months ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆94Updated 2 years ago
- Hypertypes - generic programming for heterogeneous recursive types☆119Updated 2 months ago
- Benchmarks for capture-avoiding substitution☆107Updated 2 years ago
- GRIN backend for GHC☆143Updated 3 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 7 months ago
- Strongly-typed System F in Haskell☆117Updated 2 years ago
- Prototype implementations of systems based on setoid type theory☆64Updated 3 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆78Updated 8 years ago
- Organization and planning for the Initial Types Club☆70Updated 2 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆95Updated last month
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆80Updated 3 years ago
- An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …☆110Updated 5 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆69Updated 2 years ago
- ICFP 2020 papers. Crowd-sourced☆92Updated 4 years ago
- Utilities and documentation for exploring idirs2's new elaborator reflection.☆76Updated 6 months ago
- A "implementation" of Girard's paradox in OCaml☆105Updated 9 years ago
- Programming library for Agda☆121Updated 2 months ago
- being the materials for Summer 2013's course☆110Updated last year
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆52Updated 7 years ago
- Agda formalisation of second-order abstract syntax☆51Updated 2 years ago