scott-fleischman / agda-from-nothing
A workshop on learning Agda with minimal prerequisites.
☆84Updated 8 years ago
Related projects: ⓘ
- ☆82Updated 7 years ago
- A language based on homotopy type theory with an interval☆84Updated 9 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- Learn the Agda basics in three 2-hour sessions.☆53Updated 10 months ago
- Library of the ##dependent distributed research support group☆110Updated 2 months ago
- The Iowa Agda Library☆46Updated 3 months ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆77Updated 8 years ago
- Summer school on programming in Agda☆67Updated last year
- Tiny type-checker with dependent types☆76Updated 10 years ago
- Organization and planning for the Initial Types Club☆69Updated last year
- A prototypical dependently typed languages with sized types and variances☆104Updated last year
- Dependently Typed Lambda Calculus in Haskell☆111Updated 3 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆68Updated 5 years ago
- Basics of the dependently-typed functional language Agda ^_^☆37Updated 2 years ago
- SPLV20 course notes☆106Updated last year
- Hypertypes - generic programming for heterogeneous recursive types☆111Updated last week
- Strongly-typed System F in Haskell☆117Updated last year
- Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq☆36Updated 3 years ago
- Prototype implementations of systems based on setoid type theory☆64Updated 3 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆121Updated last month
- A "implementation" of Girard's paradox in OCaml☆104Updated 9 years ago
- an implementation of stuck macros☆130Updated 3 weeks ago
- being the materials for Summer 2013's course☆110Updated last year
- The theory of algebraic graphs formalised in Agda☆86Updated 6 years ago
- Benchmarks for capture-avoiding substitution☆106Updated last year
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆77Updated 4 years ago
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- higher order dependently typed logic programing☆164Updated 6 years ago
- Formalising Type Theory in a modular way for translations between type theories☆90Updated 6 years ago
- Library of categories, with categorical constructions on them☆54Updated last year