dpndnt / library
Library of the ##dependent distributed research support group
☆112Updated 8 months ago
Alternatives and similar repositories for library:
Users that are interested in library are comparing it to the libraries listed below
- The theory of algebraic graphs formalised in Agda☆89Updated 6 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆70Updated 5 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆96Updated 5 months ago
- SPLV20 course notes☆108Updated 2 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 7 months ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- A slow-paced introduction to reflection in Agda. ---Tactics!☆100Updated 2 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆123Updated 9 months ago
- Programming library for Agda☆126Updated 7 months 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
- Utilities and documentation for exploring idirs2's new elaborator reflection.☆80Updated last month
- ICFP 2020 papers. Crowd-sourced☆91Updated 4 years ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆76Updated 6 years ago
- A small implementation of higher-order unification☆186Updated 7 years ago
- Various data structures for use in the Idris Language.☆95Updated 4 years ago
- Total Parser Combinators in Agda☆126Updated last year
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆80Updated 8 years ago
- Hypertypes - generic programming for heterogeneous recursive types☆121Updated 2 months ago
- Fast parsing from bytestrings☆156Updated 2 months ago
- Organization and planning for the Initial Types Club☆73Updated 2 years ago
- An implementation of Pie in Haskell☆205Updated 5 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆81Updated 3 years ago
- Strongly-typed System F in Haskell☆117Updated 2 years ago
- GRIN backend for GHC☆144Updated 3 years ago
- ☆45Updated 5 years ago
- Benchmarks for capture-avoiding substitution☆113Updated last month
- A "implementation" of Girard's paradox in OCaml☆105Updated 9 years ago
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆146Updated 3 years ago