UChicago-PL / smythLinks
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 3 months ago
- A bidirectional type checker☆63Updated 7 years ago
- A pure type system implemented in OCaml☆77Updated 4 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆59Updated last year
- Duo - A research language exploring duality in programming language design☆57Updated 2 years ago
- being an operating system for typechecking processes☆126Updated 2 years ago
- A monadic library for symbolic evaluation☆66Updated 2 weeks ago
- Programming Language Foundations in Lean☆37Updated last month
- A verified compiler for a lazy functional language☆36Updated 3 weeks ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 11 months ago
- ☆33Updated 7 months ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆30Updated 4 years ago
- A prototypical dependently typed languages with sized types and variances☆109Updated 2 years ago
- System F-omega normalization by hereditary substitution in Agda☆59Updated 5 years ago
- A core language and API for dependently typed languages☆94Updated 3 months ago
- A "implementation" of Girard's paradox in OCaml☆108Updated 10 years ago
- ☆36Updated 3 years ago
- bollu learns implementation of dependent typing☆30Updated 2 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- Benchmarks for capture-avoiding substitution☆114Updated this week
- Fωμ type checker and compiler☆54Updated 2 years ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆60Updated 2 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆38Updated 4 years ago
- ⛏️ A refinement proof framework for haskell☆69Updated 2 years ago
- A prototype programming language with polymorphic reachability types that track freshness, sharing and separation.☆44Updated 2 months ago
- Normalization by Evaluation for Martin-Löf Type Theory☆127Updated 11 months ago
- high-performance cubical evaluation☆73Updated last month