A modern proof language
-
Updated
Nov 15, 2024 - Haskell
A modern proof language
Building a modern functional compiler from first principles. (http://dev.stephendiehl.com/fun/)
Agda is a dependently typed programming language / interactive theorem prover.
Experimental implementation of Cubical Type Theory
A fast functional language based on two level type theory
A Super Kawaii Dependently Typed Programming Language
Fine-grain implementations of common lambda calculi in Haskell, tested with QuickCheck
ShiTT is a toy proof assistant (almost).
dependently-typed lisp with flexible compiler backends
A simple dependently typed language based on the Calculus of Constructions.
A very small implementation of the Calculus of Constructions for experimentation purposes
A PTS Supporting Induction
A dependently typed programming language prototype
Experimental implementation of a Cubical Type Theory modeled by presheaves over posets
This repository is meant to be a personal collection of implementations of the concepts from the TaPL(Types and Programming Languages) book.
The Angler Functional Programming Language
Implementation of Martin-Löf Type Theory in Haskell
⌨️ Solutions to the exercises of "Thinking With Types" in various programming languages!
Type Theory course homework (2019), ITMO University
An implementation of observational type theory.
Add a description, image, and links to the type-theory topic page so that developers can more easily learn about it.
To associate your repository with the type-theory topic, visit your repo's landing page and select "manage topics."