naalit / durin

Related projects ⓘ

Alternatives and complementary repositories for durin

• soren-n / bidi-higher-rank-poly
  Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…
  ☆22Updated 3 years ago
• AshleyYakeley / Truth
  Changes and Pinafore projects. Pull requests not accepted.
  ☆32Updated 2 weeks ago
• ecavallo / ptt
  Experimental type-checker for internally parametric type theory
  ☆32Updated 3 years ago
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆31Updated 5 years ago
• proglang / ldgv
  Label dependent dependent session types
  ☆15Updated 6 months ago
• atennapel / tinka-hs
  Dependently typed programming language written in Haskell
  ☆22Updated 2 years ago
• RedPRL / kado
  🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory
  ☆19Updated last month
• ziman / itt-idris
  ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2
  ☆23Updated last year
• hkust-taco / superf
  Artifact for paper "When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism" (https://popl24.si…
  ☆14Updated 6 months ago
• habit-lang / alb
  ☆39Updated 3 months ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆45Updated 3 years ago
• elpinal / types-1ml
  Type systems written in 1ML
  ☆9Updated 5 years ago
• Inria-Prosecco / StarMalloc
  A verified, modern, hardened memory allocator.
  ☆14Updated 3 weeks ago
• naalit / pika
  A WIP little dependently-typed systems language
  ☆37Updated 3 months ago
• ayberkt / simplc
  A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.
  ☆16Updated 4 years ago
• LPTK / simpler-sub
  Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…
  ☆25Updated 2 years ago
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆21Updated 5 years ago
• adrieng / pulsar
  Experimental functional language
  ☆18Updated 2 years ago
• mb64 / LC-interpreter
  A compiler and runtime for normalizing the untyped λ-calculus
  ☆30Updated 2 years ago
• mb64 / xtt
  A simple implementation of XTT, "A cubical language for Bishop sets"
  ☆26Updated 2 years ago
• atennapel / qtt-ts
  Implementation of Quantitative Type Theory (in TypeScript)
  ☆12Updated 3 years ago
• effectfully / Cubes
  A dependently typed type checker for a TT with intervals
  ☆21Updated 4 years ago
• gelisam / typechecker-combinators
  ☆16Updated 7 months ago
• lamdu / lamdu-calculus
  An extended typed Lambda Calculus
  ☆20Updated 3 months ago
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆34Updated 3 years ago
• annenkov / two-level
  Two-Level Type Theory
  ☆27Updated 4 years ago
• tsung-ju / SystemF
  An Agda formalization of System F and the Brown-Palsberg self-interpreter
  ☆24Updated 4 years ago