cedille / ialLinks
The Iowa Agda Library
☆47Updated 6 months ago
Alternatives and similar repositories for ial
Users that are interested in ial are comparing it to the libraries listed below
Sorting:
- ☆36Updated 3 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 2 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 11 months ago
- Tutorial series introducing Agda to the people at BCAM☆26Updated 3 years ago
- Formal Topology in Univalent Foundations (WIP).☆36Updated 2 years ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆45Updated last year
- An attempt towards univalent classical mathematics in Cubical Agda.☆29Updated last year
- Anders: Cubical Type Checker☆24Updated last year
- Formalizations of Gradually Typed Languages in Agda☆57Updated 3 months ago
- Basics of the dependently-typed functional language Agda ^_^☆39Updated 3 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- System F-omega normalization by hereditary substitution in Agda☆59Updated 5 years ago
- ☆84Updated 7 years ago
- A Unifying Cartesian Cubical Set Model☆35Updated 5 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆82Updated 8 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆59Updated 8 months ago
- ☆47Updated this week
- A tutorial on how Agda infers things☆42Updated 4 years ago
- being the materials for Summer 2013's course☆112Updated 2 years ago
- Eventually a practical 2-level TT-based compiler☆27Updated 2 months ago
- A prototypical dependently typed languages with sized types and variances☆108Updated 2 years ago
- A verified compiler for a lazy functional language☆36Updated 3 weeks ago
- Haskell implementation of the Edinburgh Logical Framework☆28Updated 3 weeks ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Benchmarks for capture-avoiding substitution☆114Updated this week
- Total Parser Combinators in Coq [maintainer=@womeier]☆44Updated this week
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 8 months ago
- A work-in-progress core language for Agda, in Agda☆52Updated last month
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆73Updated 3 years ago