tensor-fusion / GPT-Haskell
A pure Haskell implementation of a decoder-only transformer (GPT)
☆18Updated 6 months ago
Alternatives and similar repositories for GPT-Haskell:
Users that are interested in GPT-Haskell are comparing it to the libraries listed below
- Fωμ type checker and compiler☆52Updated last year
- Demo for dependent types + runtime code generation☆64Updated last month
- ☆40Updated 3 years ago
- a self-hosting lambda calculus compiler☆34Updated 3 years ago
- Kempe is a compiled stack-based language☆58Updated 3 months ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques☆44Updated last year
- 🪆 A Staged Type Theory☆34Updated last year
- Quantitative Type Theory implementation☆54Updated 3 years ago
- Extremely composable embeddable programming language☆21Updated this week
- An implementation of Haskell’s MVars in Racket☆28Updated 3 months ago
- ☆33Updated 9 months ago
- Experimental functional language☆18Updated 2 years ago
- A verified compiler for a lazy functional language☆33Updated this week
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆54Updated 3 years ago
- Toy implementation of Martin-Löf Type Theory☆28Updated 2 years ago
- Experiments with linear types☆14Updated 6 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆56Updated 7 months ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 5 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 2 years ago
- An interpreter of F-ing modules☆18Updated 5 years ago
- Session types in Idris2!☆27Updated 4 years ago
- Category theory formalized in cubical agda☆21Updated 4 years ago
- Implementing a small functional language with a combinator based graph-reduction machine☆28Updated last year
- Fast higher-order effect handlers with evidence passing☆17Updated last year
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- A non-interactive proof assistant using the Haskell type system☆36Updated 4 years ago
- A pure type system implemented in OCaml☆77Updated 4 years ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 3 years ago