An introduction to programming language theory in Agda
- Stars
- 1.5K
- Forks
- 353
- Pushed
- Today
Compare adoption and maintenance signals without opening every result.
Popular ranks GitHub matches by stars. Switch sort to inspect forks or recent maintenance.
An introduction to programming language theory in Agda
The Agda standard library
An experimental library for Cubical Agda
Development of homotopy type theory in Agda
A formalised, cross-linked reference resource for mathematics done in Homotopy Type Theory
A new Categories library for Agda
Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations
The agda-unimath library
Logical manifestations of topological concepts, and other things, via the univalent point of view.
being the lecture materials and exercises for the 2017/18 session of CS410 Advanced Functional Programming at the University of Strathclyde
Lecture notes on univalent foundations of mathematics with Agda
Compiling Agda code to readable Haskell
Categories parametrized by morphism equality, in Agda
Attracting mathematicians (others welcome too) with no experience in proof verification interested in HoTT and able to use Agda for HoTT
My slides and notes
Total Parser Combinators in Agda
Programming library for Agda
Agda formalisation of the Introduction to Homotopy Type Theory
Agda bindings to SMT-LIB2 compatible solvers.
A slow-paced introduction to reflection in Agda. ---Tactics!
ECMAScript back end for Functional Reactive Programming in Agda
The theory of algebraic graphs formalised in Agda
Algebra of Programming in Agda: Dependent Types for Relational Program Derivation
No repository description provided.
A workshop on learning Agda with minimal prerequisites.
Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
A cost-aware logical framework, embedded in Agda.
A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
Organization and planning for the Initial Types Club
A formalization of the polymorphic lambda calculus extended with iso-recursive types