Trending repositories for language Agda

A formalised, cross-linked reference resource for mathematics done in Homotopy Type Theory

A formalised, cross-linked reference resource for mathematics done in Homotopy Type Theory

A formalised, cross-linked reference resource for mathematics done in Homotopy Type Theory

Logical manifestations of topological concepts, and other things, via the univalent point of view.

An experimental library for Cubical Agda

A formalised, cross-linked reference resource for mathematics done in Homotopy Type Theory

Logical manifestations of topological concepts, and other things, via the univalent point of view.

An experimental library for Cubical Agda

A formalised, cross-linked reference resource for mathematics done in Homotopy Type Theory

Logical manifestations of topological concepts, and other things, via the univalent point of view.

An introduction to programming language theory in Agda

An experimental library for Cubical Agda

A new Categories library for Agda

The agda-unimath library

A work-in-progress core language for Agda, in Agda

Agda bindings to SMT-LIB2 compatible solvers.

The Agda standard library

A work-in-progress core language for Agda, in Agda

A formalised, cross-linked reference resource for mathematics done in Homotopy Type Theory

Logical manifestations of topological concepts, and other things, via the univalent point of view.

Agda bindings to SMT-LIB2 compatible solvers.

The agda-unimath library

An experimental library for Cubical Agda

A new Categories library for Agda

An introduction to programming language theory in Agda

The Agda standard library

PhD course on Functional Programming and Climate Impact Research

An introduction to programming language theory in Agda

A formalised, cross-linked reference resource for mathematics done in Homotopy Type Theory

An experimental library for Cubical Agda

The agda-unimath library

PhD course on Functional Programming and Climate Impact Research

Logical manifestations of topological concepts, and other things, via the univalent point of view.

The Agda standard library

A new Categories library for Agda

Compiling Agda code to readable Haskell

Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations

Formal specifications of the cardano ledger

A work-in-progress core language for Agda, in Agda

A slow-paced introduction to reflection in Agda. ---Tactics!

Total Parser Combinators in Agda

Attracting mathematicians (others welcome too) with no experience in proof verification interested in HoTT and able to use Agda for HoTT

Agda category theory library for denotational design

Agda formalisation of the Introduction to Homotopy Type Theory

Minimalistic dependent type theory with syntactic metaprogramming

Lecture notes on univalent foundations of mathematics with Agda

Abstract binding trees (abstract syntax trees plus binders), as a library in Agda

A work-in-progress core language for Agda, in Agda

Formal specifications of the cardano ledger

Agda category theory library for denotational design

The agda-unimath library

A formalised, cross-linked reference resource for mathematics done in Homotopy Type Theory

Compiling Agda code to readable Haskell

Logical manifestations of topological concepts, and other things, via the univalent point of view.

Minimalistic dependent type theory with syntactic metaprogramming

A slow-paced introduction to reflection in Agda. ---Tactics!

An experimental library for Cubical Agda

Total Parser Combinators in Agda

Attracting mathematicians (others welcome too) with no experience in proof verification interested in HoTT and able to use Agda for HoTT

A new Categories library for Agda

A cost-aware logical framework, embedded in Agda.

Abstract binding trees (abstract syntax trees plus binders), as a library in Agda

Agda formalisation of the Introduction to Homotopy Type Theory

This aims to be the most pretentious implementation of stlc in existence

H.O.T.T. using rewriting in Agda

The Agda standard library

Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations