pnwamk / sst-tutorial
☆16Updated 3 years ago
Alternatives and similar repositories for sst-tutorial:
Users that are interested in sst-tutorial are comparing it to the libraries listed below
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- A Gradual Dependently-typed Language☆14Updated 5 years ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 3 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆43Updated 2 weeks ago
- Forging Standard ML (SML) in emacs☆10Updated 2 years ago
- A Racket library for interacting with Idris over the IDE protocol☆31Updated 7 years ago
- The Alms Programming Language☆44Updated 6 years ago
- Session types in Idris2!☆27Updated 4 years ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- Racket bindings for Z3☆24Updated 5 years ago
- Hanoi tower in Coq☆25Updated 3 months ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- An implementation of MacroML [Ganz, Sabry & Taha 2001]☆30Updated 6 years ago
- Example row-polymorphism implementations☆61Updated last year
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆38Updated 9 months ago
- A Scheme-like CBPV language with Racket Interoperability☆39Updated last year
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- The MLPolyR programming language, revived☆24Updated 4 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 3 months ago
- An implementation of scoped algebraic effects and handlers in Agda.☆12Updated 4 years ago
- Generation of abstract binding trees☆28Updated 5 months ago
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 4 years ago
- Haskell implementation of a version of cubical type theory developed for my master thesis☆16Updated 2 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 9 months ago
- MetaML and MetaOCaml bibliography☆89Updated 3 months ago
- Implementation of sprintf for Coq☆18Updated 4 years ago
- An implementation of "A Pretty Expressive Printer" in Racket☆27Updated last year
- Denotational Semantics of the Untyped Lambda Calculus☆16Updated last month