Alternatives and similar repositories for incredible-solution

Users that are interested in incredible-solution are comparing it to the libraries listed below

• CategoryTheoryArchive / archive
  A digital archive of category theory papers.
  ☆30Updated last year
• jespercockx / agda-core
  A work-in-progress core language for Agda, in Agda
  ☆52Updated 3 weeks ago
• lexa-lang / lexa
  ☆33Updated 7 months ago
• felixwellen / synthetic-zariski
  Latex documentation of our understanding of the synthetic /internal theory of the Zariski-Topos
  ☆60Updated this week
• AndrasKovacs / antifunext
  antifunext
  ☆33Updated 10 months ago
• andrejbauer / notes-on-realizability
  Lecture notes on realizability
  ☆72Updated 2 months ago
• ammkrn / type_checking_in_lean4
  Type Checking in Lean 4
  ☆28Updated 2 months ago
• madvorak / grammars
  Formal grammars in Lean 3
  ☆8Updated last year
• T-Brick / molasses
  MLB support for CM (the SML/NJ Compilation and Library Manager)
  ☆18Updated last year
• RedPRL / mugen
  ♾️ A library for universe levels and universe polymorphism
  ☆34Updated 5 months ago
• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆69Updated 2 months ago
• FrozenWinters / stlc
  This aims to be the most pretentious implementation of stlc in existence
  ☆63Updated 3 years ago
• marcusrossel / verified-compiler
  A toy example of a verified compiler.
  ☆28Updated 3 weeks ago
• iwilare / church-rosser
  A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…
  ☆27Updated 2 years ago
• peterlefanulumsdaine / general-type-theories
  A (formalised) general definition of type theories
  ☆57Updated 3 years ago
• thiagofelicissimo / BiTTs
  ☆25Updated 8 months ago
• ComputerAidedLL / click-and-collect
  A web interactive tool for building proofs in the sequent calculus of Linear Logic, with its backend written in OCaml
  ☆22Updated last month
• alpha-convert / delta
  Implementation of the Delta Language
  ☆8Updated last year
• rzk-lang / sHoTT
  Formalisations for simplicial HoTT and synthetic ∞-categories.
  ☆49Updated 7 months ago
• forked-from-1kasper / ground_zero
  Ground Zero: Lean 4 HoTT Library
  ☆60Updated last month
• Beluga-lang / McTT
  A bottom-up approach to a verified implementation of MLTT
  ☆19Updated this week
• exaexa / minihm
  toy implementation of Hindley-Milner type system that prints out inference steps
  ☆11Updated last month
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆41Updated 4 years ago
• brendanzab / lean-holes
  Interactive holes for Lean 4
  ☆19Updated last year
• tomdjong / MGS-domain-theory
  Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…
  ☆44Updated last year
• maxsnew / cubical-categorical-logic
  Extensions to the cubical stdlib category theory for categorical logic/type theory
  ☆29Updated 2 weeks ago
• UChicago-PL / smyth
  Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.
  ☆54Updated 4 years ago
• nomeata / lean-calcify
  ☆30Updated 2 months ago
• jonsterling / agda-synthetic-domain-theory
  ☆17Updated 2 years ago
• emilyriehl / 721
  Course website for Math 721: Homotopy Type Theory, taught at Johns Hopkins in Fall 2021
  ☆47Updated 3 years ago