brownplt / B2T2Links
The Brown Benchmark for Table Types (B2T2)
☆64Updated last year
Alternatives and similar repositories for B2T2
Users that are interested in B2T2 are comparing it to the libraries listed below
Sorting:
- Apple array system☆66Updated last week
- source code for the bondi programming language☆40Updated 6 years ago
- ☆35Updated last year
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆59Updated last year
- The Makam Metalanguage☆198Updated 2 years ago
- "A Functional Reboot for Deep Learning", an invited talk for Summer BOB 2019 in Berlin☆52Updated 5 years ago
- ☆90Updated 3 years ago
- Datalog + Egg = Good☆66Updated 2 years ago
- A compiler for functional programs on serialized data☆164Updated last week
- a self-hosting lambda calculus compiler☆35Updated 2 months ago
- Changes and Pinafore projects. Pull requests not accepted.☆33Updated 2 weeks ago
- A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference☆52Updated 4 months ago
- Build system☆122Updated last year
- Interpreter for the reversible functional language rFun☆36Updated 7 years ago
- The artifact associated with "Parsing with Zippers (Functional Pearl)" (Darragh and Adams) to appear in ICFP 2020.☆28Updated last year
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- Slides and handwritten notes on the course on models of programming languages☆51Updated 4 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 6 years ago
- Talk: "Can Tensor Programming Be Liberated from the Fortran Data Paradigm?"☆64Updated 3 years ago
- Bologna Optimal Higher-Order Machine, Version 1.1☆72Updated 8 years ago
- A programming language with infinite arrays☆31Updated 5 years ago
- Book: Introduction to Dependent Types with Idris☆78Updated 2 years ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- Kempe is a compiled stack-based language☆58Updated 8 months ago
- Agda lecture notes for the Functional Programming course at TU Delft☆127Updated last year
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆131Updated 4 years ago
- An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types☆90Updated 2 years ago
- Paper and talk☆54Updated last year
- Accompanying materials for "A Core Calculus for Documents"☆33Updated last year
- Generation of abstract binding trees☆28Updated 8 months ago