Agda is a dependently typed programming language / interactive theorem prover.
-
Updated
Jun 24, 2024 - Haskell
Agda is a dependently typed programming language / interactive theorem prover.
Sized sequence data-types
Type-level well-kinded natural numbers.
Presburger arithmetic solver for built-in type-level naturals
A dependently typed programming language prototype
A dependently typed esolang by Pablo Barenbaum. This repo restores the full revision history.
fcf-containers add tools that can be used with first-class-families
A fast functional language based on two level type theory
A Haskell framework to define valid deep learning models and export them to other frameworks like TensorFlow JS or Keras.
Support code for talk 'XXIst century shall be typed or not be'
normalization by evaluation as a way of life
A Teeny Type Theory
Literate program notes from reading 'TDD with Idris' book comparing Idris and Haskell
Dependently typed programming language implemented in Literate Haskell.
Dependently Typed Lambda Calculus in Haskell
Mallet is an experimental multi-paradigm programming language.
Working towards a Pie (The Little Typer) interpreter
Add a description, image, and links to the dependent-types topic page so that developers can more easily learn about it.
To associate your repository with the dependent-types topic, visit your repo's landing page and select "manage topics."