UChicago-PL / smyth
Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.
☆30Updated 3 years ago
Related projects: ⓘ
- Efficient effect handlers based on Evidence Passing Semantics.☆27Updated 3 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- A bidirectional type checker☆55Updated 7 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- Duo - A research language exploring duality in programming language design☆54Updated last year
- A pure type system implemented in OCaml☆78Updated 3 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- LL(1) parser generator verified in Coq☆44Updated 4 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆30Updated 11 months ago
- Formalization of CBPV extended with effect and coeffect tracking☆11Updated 3 weeks ago
- EGraphs in OCaml☆59Updated 8 months ago
- 🪆 A Staged Type Theory☆35Updated last year
- Minimalistic dependent type theory with syntactic metaprogramming☆55Updated 3 months ago
- Spartan implementation of H.O.T.T.☆25Updated 2 years ago
- Verified C programming in Agda☆16Updated 3 years ago
- Haskell monad transformer for weighted, non-deterministic computation☆28Updated 9 months ago
- A dependent type theory with user defined data types☆46Updated 2 years ago
- Anders: Cubical Type Checker☆18Updated 10 months ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- Fωμ type checker and compiler☆51Updated last year
- A verified compiler for a lazy functional language☆31Updated this week
- A deterministic parser with fused lexing☆70Updated last year
- A type theory with native support for Polynomial Functors.☆37Updated 11 months ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 2 years ago
- ♾️ A library for universe levels and universe polymorphism☆32Updated 3 months ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical types☆25Updated this week
- A monadic library for symbolic evaluation☆51Updated this week
- An implementation of a simple Neural network in Idris using category theory.☆22Updated 5 months ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆38Updated 3 years ago
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago