scott-fleischman / agda-from-nothing
A workshop on learning Agda with minimal prerequisites.
☆85Updated 8 years ago
Alternatives and similar repositories for agda-from-nothing:
Users that are interested in agda-from-nothing are comparing it to the libraries listed below
- ☆84Updated 7 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 5 years ago
- Summer school on programming in Agda☆68Updated last year
- Library of categories, with categorical constructions on them☆56Updated last year
- Learn the Agda basics in three 2-hour sessions.☆56Updated last year
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago
- Basics of the dependently-typed functional language Agda ^_^☆39Updated 3 years ago
- A language based on homotopy type theory with an interval☆85Updated 10 years ago
- Where my everyday research happens☆52Updated last week
- The theory of algebraic graphs formalised in Agda☆89Updated 6 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆82Updated 8 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆72Updated 3 years ago
- Tiny type-checker with dependent types☆77Updated 11 years ago
- Library of the ##dependent distributed research support group☆112Updated 9 months ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 4 years ago
- an implementation of stuck macros☆139Updated last month
- A "implementation" of Girard's paradox in OCaml☆106Updated 10 years ago
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 10 months ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆52Updated 8 years ago
- System F-omega normalization by hereditary substitution in Agda☆58Updated 5 years ago
- ECMAScript back end for Functional Reactive Programming in Agda☆104Updated 7 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 8 months ago
- Strongly-typed System F in Haskell☆116Updated 2 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆124Updated 10 months ago
- An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system☆84Updated 7 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆52Updated 7 years ago