UChicago-PL / smyth
Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.
☆31Updated 3 years ago
Related projects ⓘ
Alternatives and complementary repositories for smyth
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆27Updated 3 years ago
- Demo for dependent types + runtime code generation☆54Updated this week
- A pure type system implemented in OCaml☆77Updated 3 years ago
- EGraphs in OCaml☆60Updated 10 months ago
- A bidirectional type checker☆57Updated 7 years ago
- A deterministic parser with fused lexing☆71Updated last year
- Duo - A research language exploring duality in programming language design☆57Updated last year
- 🪆 A Staged Type Theory☆34Updated last year
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- A template for you to implement Hazelnut yourself☆19Updated last month
- Minimalistic dependent type theory with syntactic metaprogramming☆55Updated 5 months ago
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆99Updated last year
- Fωμ type checker and compiler☆51Updated last year
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆33Updated last year
- A verified compiler for a lazy functional language☆32Updated last month
- Graph Theory [maintainers=@chdoc,@damien-pous]☆34Updated 4 months ago
- A structure editor for a simple functional programming language, with Vim-like shortcuts and commands.☆15Updated 11 months ago
- A monadic library for symbolic evaluation☆55Updated 2 weeks ago
- An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types☆90Updated last year
- A dependent type theory with user defined data types☆45Updated 3 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆38Updated 4 years ago
- Playing with type systems☆46Updated 2 years ago
- Notes and handouts from OPLSS 2018☆53Updated 6 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆78Updated 8 years ago
- We define a simple programming language, simp_lang, then instantiate Iris to verify simple simp_lang programs with concurrent separation …☆49Updated 6 months ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- ☆35Updated 3 years ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆44Updated 8 months ago