cedille / ial
The Iowa Agda Library
☆47Updated 5 months ago
Alternatives and similar repositories for ial:
Users that are interested in ial are comparing it to the libraries listed below
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated last month
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- A tutorial on how Agda infers things☆41Updated 4 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 10 months ago
- Eventually a practical 2-level TT-based compiler☆27Updated last month
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆82Updated 8 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆72Updated 3 years ago
- ☆84Updated 7 years ago
- Summer school on programming in Agda☆68Updated last year
- ☆36Updated 3 years ago
- being the materials for Summer 2013's course☆112Updated 2 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Basics of the dependently-typed functional language Agda ^_^☆39Updated 3 years ago
- A TACtic library for Agda☆48Updated 7 months ago
- Awesome Agda Programming☆16Updated 4 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- Haskell implementation of a version of cubical type theory developed for my master thesis☆16Updated 2 years ago
- Implementation for ICFP 2020 paper☆50Updated 3 years ago
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago
- Formal Topology in Univalent Foundations (WIP).☆36Updated 2 years ago
- System F-omega normalization by hereditary substitution in Agda☆58Updated 5 years ago
- Formalizing linear algebra in Agda by representing matrices as functions☆26Updated last year
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- Formalizations of Gradually Typed Languages in Agda☆57Updated 3 months ago
- Benchmarks for capture-avoiding substitution☆113Updated this week
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- A Unifying Cartesian Cubical Set Model☆35Updated 5 years ago
- Where my everyday research happens☆52Updated this week
- ☆30Updated 6 years ago
- A non-interactive proof assistant using the Haskell type system☆37Updated 5 years ago