Alternatives and similar repositories for tiny-gpt2

Users that are interested in tiny-gpt2 are comparing it to the libraries listed below

• Kraks / quantum-compiler
  Quantum circuits compiler with staging and continuations
  ☆16Updated 6 months ago
• RedPRL / stagedtt
  🪆 A Staged Type Theory
  ☆35Updated last year
• xnning / MpEff
  Efficient effect handlers based on Evidence Passing Semantics.
  ☆30Updated 4 years ago
• mb64 / xtt
  A simple implementation of XTT, "A cubical language for Bishop sets"
  ☆26Updated 3 years ago
• andrejbauer / partial-combinatory-algebras
  A Lean 4 formalization of partial combinatory algebras.
  ☆14Updated 4 months ago
• matijapretnar / millet
  A ML-like pure functional language that can be used as a template for creating your own language
  ☆28Updated 4 months ago
• adrieng / melitte
  Toy implementation of Martin-Löf Type Theory
  ☆28Updated 2 years ago
• hazelgrove / hazelnut-dynamics-agda
  mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics
  ☆21Updated 11 months ago
• effect-handlers / effect-handlers-bench
  Benchmark repository of polyglot effect handler examples
  ☆24Updated last month
• Guest0x0 / trebor
  an implementation of Observational Type Theory (OTT) and more
  ☆26Updated 2 years ago
• favonia / hdtt2020-notes
  ☆36Updated 3 years ago
• solomon-b / lambda-calculus-hs
  Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques
  ☆44Updated 3 months ago
• rzrn / anders
  Anders: Cubical Type Checker
  ☆24Updated last year
• ice1000 / agda-mode
  Accessing Agda's interaction mode via command line & external tactic for Agda.
  ☆26Updated 4 years ago
• madvorak / read-lean
  How to read Lean
  ☆17Updated 4 months ago
• polytypic / f-omega-mu
  Fωμ type checker and compiler
  ☆54Updated 2 years ago
• kangxyz / cubical-classics
  An attempt towards univalent classical mathematics in Cubical Agda.
  ☆30Updated last year
• ollef / system-f-omega-agda
  A formalization of System Fω in Agda
  ☆17Updated 3 months ago
• sjoerdvisscher / unfoldable
  Class of data structures that can be unfolded.
  ☆22Updated last year
• bollu / minitt
  bollu learns implementation of dependent typing
  ☆30Updated 2 years ago
• gelisam / typechecker-combinators
  ☆17Updated last year
• alt-romes / reference-counting
  Reference counting with linear types
  ☆31Updated 10 months ago
• pi8027 / stablesort
  Stable sort algorithms and their stability proofs in Coq
  ☆22Updated last month
• artagnon / bonak
  🧊 An indexed construction of semi-simplicial and semi-cubical sets
  ☆29Updated last week
• RedPRL / algaett
  🦠 An experimental elaborator for dependent type theory using effects and handlers
  ☆36Updated last year
• marcusrossel / verified-compiler
  A toy example of a verified compiler.
  ☆28Updated last month
• julesjacobs / cgraphs
  Deadlock freedom by type checking
  ☆20Updated 2 years ago
• folivetti / srtree
  Haskell library for representing and manipulating Symbolic Regression Tree
  ☆11Updated 2 weeks ago
• bobatkey / CS316-2022
  Materials for the 2022-2023 edition of CS316 "Functional Programming"
  ☆24Updated 2 years ago
• coq-tactician / coq-tactician
  A Seamless, Interactive Tactic Learner and Prover for Coq
  ☆68Updated last month