brownplt / B2T2Links
The Brown Benchmark for Table Types (B2T2)
☆64Updated last week
Alternatives and similar repositories for B2T2
Users that are interested in B2T2 are comparing it to the libraries listed below
Sorting:
- Apple array system☆67Updated last month
- A compiler for functional programs on serialized data☆165Updated last month
- Interpreter for the reversible functional language rFun☆36Updated 7 years ago
- The Makam Metalanguage☆198Updated 2 years ago
- ☆90Updated 3 years ago
- ☆36Updated last year
- source code for the bondi programming language☆40Updated 6 years ago
- Datalog + Egg = Good☆66Updated 2 years ago
- Talk: "Can Tensor Programming Be Liberated from the Fortran Data Paradigm?"☆64Updated 3 years ago
- A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference☆54Updated 5 months ago
- Accompanying materials for "A Core Calculus for Documents"☆33Updated last year
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆60Updated last year
- Bologna Optimal Higher-Order Machine, Version 1.1☆74Updated 8 years ago
- Forge: A Tool and Language for Teaching Formal Methods☆82Updated 3 weeks ago
- Kempe is a compiled stack-based language☆58Updated 10 months ago
- The Next Generation of Compositional Programming☆52Updated last month
- A graphical interactive proof assistant designed for education☆167Updated 8 months ago
- A Datalog extension to reason about time with CTL operators☆14Updated 5 years ago
- A comparison of how computational effects and handlers are implemented in various programming languages.☆142Updated 6 years ago
- Agda lecture notes for the Functional Programming course at TU Delft☆128Updated 2 weeks ago
- Slides and handwritten notes on the course on models of programming languages☆51Updated 4 years ago
- Real number computation software☆126Updated 2 years ago
- Slog 1.0☆43Updated last year
- Changes and Pinafore projects. Pull requests not accepted.☆34Updated 2 months ago
- Educational Proof Assistant for Type Theory☆74Updated last year
- A minimal, fast Datalog implementation in Haskell that compiles to LLVM IR☆222Updated last year
- A basic type system on top of Prolog, along with higher-order clauses. Translates to normal Prolog.☆29Updated 7 years ago
- Alternative algorithm for algebraic subtyping.☆170Updated last month
- A custom parser/auto-formatter for Standard ML☆79Updated 2 months ago
- A pure type system implemented in OCaml☆78Updated 4 years ago