Here are
159 public repositories
matching this topic...
λΠ Programming Language Theory
-
Updated
Jan 11, 2021
-
Haskell
Agda is a dependently typed programming language / interactive theorem prover.
-
Updated
Dec 15, 2021
-
Haskell
A friendly little systems language with first-class types. Very WIP! 🚧 🚧 🚧
-
Updated
May 16, 2021
-
Rust
Experimental implementation of Cubical Type Theory
-
Updated
Aug 20, 2021
-
Haskell
Programming language agnostic type construction language based on polynomials.
-
Updated
Dec 7, 2021
-
Idris
Research on integrating datalog & lambda calculus via monotonicity types
The People's Refinement Logic
-
Updated
Nov 4, 2019
-
Standard ML
"Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory
-
Updated
Nov 29, 2021
-
OCaml
Lecture notes on univalent foundations of mathematics with Agda
A Super Kawaii Dependently Typed Programming Language
-
Updated
Jul 12, 2018
-
Haskell
A selection of formal proofs in Coq.
-
Updated
Nov 30, 2021
-
OCaml
List of resources about foundational knowledge for programmers (supposed to last a few decades)
Variant types in TypeScript
-
Updated
Nov 29, 2021
-
TypeScript
A research project in path semantics, a re-interpretation of functions for expressing mathematics
-
Updated
Dec 15, 2021
-
Rust
A SuperCompiler for Martin-Löf's Type Theory
-
Updated
Oct 29, 2021
-
Scala
Formalising Type Theory in a modular way for translations between type theories
Dependently-typed lambda calculus, Mini-TT, extended and implemented in Rust
-
Updated
Sep 21, 2020
-
Rust
Logical manifestations of topological concepts, and other things. This version adopts the univalent point of view.
-
Updated
Dec 16, 2021
-
Agda
Dependently-typed row-polymorphic programming language, evolved from minitt-rs
-
Updated
Sep 21, 2020
-
Rust
Exercises from Benjamin Pierce's "Types and Programming Languages" textbook + extras!
-
Updated
Jul 26, 2020
-
Rust
A collection of papers on modules.
A fast functional language based on two level type theory
-
Updated
Dec 8, 2021
-
Haskell
Normalization by evaluation for Martin-Löf Type Theory with dependent records
-
Updated
Jun 22, 2019
-
Rust
(WIP) Dependently-typed programming language with Agda style dependent pattern matching
Book: Gentle Introduction to Dependent Types with Idris
Improve this page
Add a description, image, and links to the
type-theory
topic page so that developers can more easily learn about it.
Curate this topic
Add this topic to your repo
To associate your repository with the
type-theory
topic, visit your repo's landing page and select "manage topics."
Learn more
You can’t perform that action at this time.
You signed in with another tab or window. Reload to refresh your session.
You signed out in another tab or window. Reload to refresh your session.
Describe the bug
When installing the Kind toolchain the
kind-scmcommand is installed. When I read [THEOREMS.md][theorems] the command is namedkind.To Reproduce
Steps to reproduce the behavior:
THEOREMS.md][theorems]Expected behavior
I would expect