msullivan / sml-utilLinks
A handful of potentially useful crap for Standard ML
☆21Updated 8 years ago
Alternatives and similar repositories for sml-util
Users that are interested in sml-util are comparing it to the libraries listed below
Sorting:
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- A bare-bones LCF-style proof assistant☆24Updated 6 years ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 10 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated last year
- The official interpreter for the Jeopardy language☆16Updated 2 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Experiments with sequent calculi☆27Updated 4 years ago
- A tiny language for teaching and experimenting with Refinement Types☆48Updated 4 years ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 4 months ago
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Updated 8 years ago
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Updated 8 years ago
- The Prettiest Printer☆35Updated last year
- An implementation of the "lightweight" linear type system for System F◦ presented in "Lightweight Linear Types in System F◦" by Mazurak, …☆33Updated 10 years ago
- YUP is a proof checker that performs automatic checking of simple program-correctness proofs of functional programs through inductive and…☆36Updated 2 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- The compilation target that functional programmers always wanted.☆62Updated 5 years ago
- Resurrecting Lennart Augustsson's implementation of Cayenne☆38Updated 12 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 3 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Updated 6 years ago
- System F in coq.☆19Updated 10 years ago
- Miller/pattern unification in Agda☆68Updated 11 years ago
- Alternative Core language for GHC plugins☆39Updated 9 years ago
- second-order abstract syntax☆31Updated 4 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 9 months ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 2 months ago
- Deciding Presburger arithmetic in agda☆32Updated 2 years ago
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 3 years ago