pnwamk / sst-tutorialLinks
☆18Updated 4 years ago
Alternatives and similar repositories for sst-tutorial
Users that are interested in sst-tutorial are comparing it to the libraries listed below
Sorting:
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- The Alms Programming Language☆44Updated 7 years ago
- A Gradual Dependently-typed Language☆14Updated 6 years ago
- MetaML and MetaOCaml bibliography☆98Updated last year
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆104Updated 8 months ago
- Racket bindings for Z3☆24Updated 6 years ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 4 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 12 years ago
- Haskell implementation and Coq proof for an implicit polymorphic gradual type system.☆17Updated 5 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆33Updated 4 years ago
- A dynamically-typed CBPV language embedded in Racket☆40Updated last year
- Generation of abstract binding trees☆27Updated 4 months ago
- An equational theorem prover based on Knuth-Bendix completion☆57Updated 3 weeks ago
- Implementations of various toy programming languages☆12Updated 7 years ago
- A statically-typed programming language based on "F-ing modules"☆81Updated 5 years ago
- An implementation of MacroML [Ganz, Sabry & Taha 2001]☆33Updated 7 years ago
- Interpreter for the reversible functional language rFun☆38Updated 7 years ago
- Two-Level Type Theory☆28Updated 6 years ago
- Session types in Idris2!☆27Updated 5 years ago
- Standard ML compiler based on typed intermediate languages.☆51Updated 11 years ago
- Fωμ type checker and compiler☆56Updated 3 years ago
- Mirror of Epigram 2, by Conor McBride, et al.☆58Updated 5 years ago
- The Next Generation of Compositional Programming☆56Updated this week
- A Racket library for interacting with Idris over the IDE protocol☆31Updated 8 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Updated last year
- The MLPolyR programming language, revived☆25Updated 5 years ago
- ☆22Updated 5 years ago
- higher order dependently typed logic programing☆173Updated 7 years ago
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 3 years ago