TypedefsProgramming language agnostic type construction language based on polynomials.
Stars: ✭ 337 (-26.9%)
DatafunResearch on integrating datalog & lambda calculus via monotonicity types
Stars: ✭ 287 (-37.74%)
Write You A HaskellBuilding a modern functional compiler from first principles. (http://dev.stephendiehl.com/fun/)
Stars: ✭ 3,064 (+564.64%)
lplzooFine-grain implementations of common lambda calculi in Haskell, tested with QuickCheck
Stars: ✭ 32 (-93.06%)
Type-TheoryLecture note on Lambda Calculus and Types for FLOLAC
Stars: ✭ 26 (-94.36%)
MLPolyRThe MLPolyR programming language, revived
Stars: ✭ 21 (-95.44%)
Isabelle-HoTTAn experimental implementation of homotopy type theory in the interactive proof assistant Isabelle
Stars: ✭ 30 (-93.49%)
variantVariant types in TypeScript
Stars: ✭ 147 (-68.11%)
path semanticsA research project in path semantics, a re-interpretation of functions for expressing mathematics
Stars: ✭ 136 (-70.5%)
cicadaCicada Language
Stars: ✭ 9 (-98.05%)
tt-in-cubicalType Theory in Type Theory using Cubical Agda
Stars: ✭ 12 (-97.4%)
Idris-HoTTHomotopy Type Theory proofs in Idris
Stars: ✭ 19 (-95.88%)
TypeTopologyLogical manifestations of topological concepts, and other things. This version adopts the univalent point of view.
Stars: ✭ 132 (-71.37%)
catA categorical semantics library in Agda.
Stars: ✭ 16 (-96.53%)
shapesafeSHAPE/S∀F∃: static prover/type-checker for N-D array programming in Scala, a use case of intuitionistic type theory
Stars: ✭ 17 (-96.31%)
voile-rsDependently-typed row-polymorphic programming language, evolved from minitt-rs
Stars: ✭ 89 (-80.69%)
minitt-rsDependently-typed lambda calculus, Mini-TT, extended and implemented in Rust
Stars: ✭ 101 (-78.09%)
gidtiBook: Gentle Introduction to Dependent Types with Idris
Stars: ✭ 70 (-84.82%)
reed-thesisMy undergradate thesis on coinductive types in univalent type theory
Stars: ✭ 14 (-96.96%)
Sml RedprlThe People's Refinement Logic
Stars: ✭ 214 (-53.58%)
Redtt"Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory
Stars: ✭ 175 (-62.04%)
LeanHomepage
Theorem Proving in Lean
FAQ
Stars: ✭ 2,006 (+335.14%)
DittoA Super Kawaii Dependently Typed Programming Language
Stars: ✭ 154 (-66.59%)
ProofsA selection of formal proofs in Coq.
Stars: ✭ 135 (-70.72%)
KindA modern proof language
Stars: ✭ 2,075 (+350.11%)
AgdaAgda is a dependently typed programming language / interactive theorem prover.
Stars: ✭ 1,699 (+268.55%)
TtliteA SuperCompiler for Martin-Löf's Type Theory
Stars: ✭ 94 (-79.61%)
Cooltt😎TT
Stars: ✭ 85 (-81.56%)
Formal Type TheoryFormalising Type Theory in a modular way for translations between type theories
Stars: ✭ 74 (-83.95%)
Modules PapersA collection of papers on modules.
Stars: ✭ 74 (-83.95%)
Rust Nbe For MlttNormalization by evaluation for Martin-Löf Type Theory with dependent records
Stars: ✭ 72 (-84.38%)
Narc Rs(WIP) Dependently-typed programming language with Agda style dependent pattern matching
Stars: ✭ 58 (-87.42%)
MlangTowards changing things and see if it proofs
Stars: ✭ 57 (-87.64%)
HottHomotopy type theory
Stars: ✭ 946 (+105.21%)
PikeletA friendly little systems language with first-class types. Very WIP! 🚧 🚧 🚧
Stars: ✭ 485 (+5.21%)
PltλΠ Programming Language Theory
Stars: ✭ 4,609 (+899.78%)