UChicago-PL / smyth
Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.
☆54Updated 4 years ago
Alternatives and similar repositories for smyth
Users that are interested in smyth are comparing it to the libraries listed below
Sorting:
- Demo for dependent types + runtime code generation☆69Updated 2 months ago
- A bidirectional type checker☆63Updated 7 years ago
- Duo - A research language exploring duality in programming language design☆57Updated last year
- ☆33Updated 7 months ago
- Programming Language Foundations in Lean☆36Updated 3 weeks ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆58Updated last year
- A pure type system implemented in OCaml☆78Updated 4 years ago
- A verified compiler for a lazy functional language☆35Updated this week
- A prototype programming language with polymorphic reachability types that track freshness, sharing and separation.☆44Updated 2 months ago
- A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference☆45Updated 3 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 10 months ago
- being an operating system for typechecking processes☆126Updated 2 years ago
- A tutorial on how Agda infers things☆41Updated 4 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆29Updated 4 years ago
- Interaction net / combinator language based on https://core.ac.uk/download/pdf/81113716.pdf☆30Updated last year
- A toy dependent typed language.☆28Updated 3 weeks ago
- A collection of programming languages and type systems.☆33Updated 8 months ago
- bollu learns implementation of dependent typing☆28Updated 2 years ago
- Lean type-checker written in Scala.☆36Updated 3 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆126Updated 11 months ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 6 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆36Updated last year
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- A template for you to implement Hazelnut yourself☆21Updated 4 months ago
- A core language and API for dependently typed languages☆92Updated 2 months ago
- bidirectional type checking algorithms for higher-ranked polymorphism☆19Updated 3 years ago
- Fωμ type checker and compiler☆54Updated 2 years ago
- Canonical is a performant sound and complete type inhabitation solver for dependent type theory.☆25Updated last week
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆60Updated 2 years ago
- Benchmarks for capture-avoiding substitution☆113Updated last week