dpndnt / libraryLinks
Library of the ##dependent distributed research support group
☆113Updated 10 months ago
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☆90Updated 6 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- Organization and planning for the Initial Types Club☆73Updated 2 years ago
- Programming library for Agda☆128Updated 9 months ago
- Total Parser Combinators in Agda☆128Updated 2 years ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆101Updated 3 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- SPLV20 course notes☆108Updated 2 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆127Updated 11 months ago
- ICFP 2020 papers. Crowd-sourced☆91Updated 4 years ago
- Hypertypes - generic programming for heterogeneous recursive types☆122Updated 4 months ago
- An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …☆111Updated 6 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 9 months ago
- ☆45Updated 5 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆98Updated 7 months ago
- Strongly-typed System F in Haskell☆117Updated 2 years ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆76Updated 6 years ago
- Drafts, notes and resources for adding linear typing to GHC.☆78Updated 5 years ago
- A small implementation of higher-order unification☆188Updated 7 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆82Updated 8 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
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- ☆84Updated 7 years ago
- A prototypical dependently typed languages with sized types and variances☆108Updated 2 years ago
- being the materials for Summer 2013's course☆112Updated 2 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- A "implementation" of Girard's paradox in OCaml☆108Updated 10 years ago
- Learn the Agda basics in three 2-hour sessions.☆56Updated last year