Blazingly type safe GPU accelerated Multi-Layer Perceptron
-
Updated
Sep 16, 2023 - OCaml
Blazingly type safe GPU accelerated Multi-Layer Perceptron
An implementation of dependently typed lambda calculus
Type checker for pure MLTT using well-scoped de Bruijn indices
Hurricane: HoTT-I Type System
Castle Bravo: Experimental HoTT Implementation
Anders: Cubical Type Checker
A type checker for FreshMLTT, a dependent type theory with abstractable names together with an equational characterisation of freshness.
Minimal core language based on dependent function type, pair type, recursive type, sum type and record type.
ML modules and functors as first-class citizens by unifying ML modules and ML records with path dependent types and subtyping.
🧊 Модальний гомотопічний верифікатор математики
A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
A garden of small programming language implementations 🪴
Contextual types meet mechanized metatheory!
CoqHammer: An Automated Reasoning Hammer Tool for Coq - Proof Automation for Dependent Type Theory
Proof assistant based on the λΠ-calculus modulo rewriting
Coq is a formal proof management system. It provides a formal language to write mathematical definitions, executable algorithms and theorems together with an environment for semi-interactive development of machine-checked proofs.
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."