Alternatives and similar repositories for BrainCoqulus

Users that are interested in BrainCoqulus are comparing it to the libraries listed below

• ehatti / LHL
  Linearizability Hoare Logic
  ☆14Updated 6 months ago
• dunhamsteve / newt
  A toy dependent typed language.
  ☆32Updated 3 weeks ago
• opencompl / C-parsing-for-Lean4
  A parser for ANSI C, in Lean4.
  ☆20Updated last year
• gebner / trepplein
  Lean type-checker written in Scala.
  ☆37Updated 3 years ago
• jfdm / velo-lang
  Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.
  ☆16Updated 2 years ago
• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆71Updated 7 months ago
• thamugadi / semantic-preservation
  Attempt to prove semantic preservation (forward simulation) for a simple compiler.
  ☆11Updated last year
• ollef / system-f-omega-agda
  A formalization of System Fω in Agda
  ☆19Updated 7 months ago
• phase / dtt
  dependent type theory experiment
  ☆26Updated last year
• brendanzab / lean-holes
  Interactive holes for Lean 4
  ☆22Updated last year
• ncfavier / agda-stuff
  My Agda blog/lab/playground
  ☆13Updated last week
• eashanhatti / konna
  ☆16Updated 3 years ago
• 0xd34df00d / refinedt
  Refinement types + dependent types = ❤️
  ☆61Updated 3 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated last year
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆37Updated 5 months ago
• rzrn / anders
  Anders: Cubical Type Checker
  ☆23Updated last year
• UlfNorell / x86-agda
  Inline, type safe X86-64 assembly programming in Agda
  ☆70Updated 6 years ago
• chameco / bramble
  dependently-typed lisp with flexible compiler backends
  ☆27Updated 6 years ago
• RedPRL / algaett
  🦠 An experimental elaborator for dependent type theory using effects and handlers
  ☆37Updated last month
• mit-plv / rupicola
  Gallina to Bedrock2 compilation toolkit
  ☆59Updated last week
• HoTT / M-types
  A formalization of M-types in Agda
  ☆34Updated 5 years ago
• pamellies / models-of-programming-languages
  Slides and handwritten notes on the course on models of programming languages
  ☆51Updated 4 years ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆61Updated last year
• jsiek / gradual-typing-in-agda
  Formalizations of Gradually Typed Languages in Agda
  ☆57Updated 7 months ago
• mb64 / LC-interpreter
  A compiler and runtime for normalizing the untyped λ-calculus
  ☆32Updated 3 years ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆47Updated 3 years ago
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆78Updated 3 weeks ago
• gelisam / typechecker-combinators
  ☆17Updated last year
• T-Brick / c0deine
  Reference compiler for c0
  ☆37Updated 3 months ago
• hkust-taco / superf
  Artifact for paper "When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism" (https://popl24.si…
  ☆15Updated last year