dpndnt / library
Library of the ##dependent distributed research support group
☆111Updated 6 months ago
Alternatives and similar repositories for library:
Users that are interested in library are comparing it to the libraries listed below
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆70Updated 5 years ago
- The theory of algebraic graphs formalised in Agda☆89Updated 6 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- SPLV20 course notes☆107Updated 2 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
- Hypertypes - generic programming for heterogeneous recursive types☆119Updated this week
- Agda bindings to SMT-LIB2 compatible solvers.☆95Updated 3 months ago
- Utilities and documentation for exploring idirs2's new elaborator reflection.☆79Updated last month
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆71Updated 2 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 9 months ago
- ICFP 2020 papers. Crowd-sourced☆92Updated 4 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 5 months ago
- Organization and planning for the Initial Types Club☆72Updated 2 years ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 3 years ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆96Updated 2 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆75Updated 6 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆122Updated 7 months ago
- A "implementation" of Girard's paradox in OCaml☆105Updated 9 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
- Programming library for Agda☆125Updated 4 months ago
- Agda formalisation of second-order abstract syntax☆53Updated 2 years ago
- Learn the Agda basics in three 2-hour sessions.☆57Updated last year
- Strongly-typed System F in Haskell☆117Updated 2 years ago
- Total Parser Combinators in Agda☆125Updated last year
- A prototypical dependently typed languages with sized types and variances☆104Updated 2 years ago
- An implementation of Pie in Haskell☆204Updated 5 years ago
- ☆45Updated 5 years ago
- An interactive theorem prover based on lambda-tree syntax☆90Updated this week
- ☆84Updated 7 years ago