lang-talk / meetups
A community around PL at Prague.
☆18Updated 4 months ago
Alternatives and similar repositories for meetups:
Users that are interested in meetups are comparing it to the libraries listed below
- Duo - A research language exploring duality in programming language design☆57Updated last year
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆54Updated 4 years ago
- bollu learns implementation of dependent typing☆28Updated 2 years ago
- Example language server (LSP) implementation for a toy language☆59Updated 3 years ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- Fast parsing from bytestrings☆157Updated 2 weeks ago
- Quick explanation of eliminating left recursion in Haskell parsers☆49Updated 3 years ago
- 🚧 a work in progress effect system for Haskell 🚧☆126Updated last year
- A simple library for reporting compiler/interpreter errors☆262Updated 8 months ago
- Alternative algorithm for algebraic subtyping.☆161Updated last month
- A tool to make solving type errors in Haskell simple and fun.☆36Updated 2 years ago
- A bidirectional type checker☆63Updated 7 years ago
- being an operating system for typechecking processes☆126Updated 2 years ago
- Fir programming language☆40Updated this week
- Demo for dependent types + runtime code generation☆69Updated 2 months ago
- System F-omega normalization by hereditary substitution in Agda☆58Updated 5 years ago
- Benchmarks for capture-avoiding substitution☆113Updated last week
- ☆72Updated 2 years ago
- Dependent type checker using normalisation by evaluation☆258Updated 7 months ago
- Handy macro to generate C-FFI bindings to Rust for Haskell☆69Updated last week
- Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…☆26Updated 2 years ago
- high-performance cubical evaluation☆71Updated 4 months ago
- Setoid type theory implementation☆38Updated last year
- Show Haskell type annotations when doing code review on Github☆142Updated 4 years ago
- This aims to be the most pretentious implementation of stlc in existence☆63Updated 3 years ago
- A Language with Dependent Data and Codata Types☆99Updated last week
- Pure functional programming with whole-program mutability inference☆66Updated last month
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆58Updated last year
- Fast and concise extensible effects☆108Updated last year
- A tutorial on how Agda infers things☆41Updated 4 years ago