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:
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- Deciding Presburger arithmetic in agda☆33Updated 2 years ago
- Tiny type-checker with dependent types☆78Updated 12 years ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 10 years ago
- 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
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- Haskell implementation of the Edinburgh Logical Framework☆32Updated 3 weeks ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- The compilation target that functional programmers always wanted.☆62Updated 5 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆31Updated 2 years ago
- Alternative Core language for GHC plugins☆39Updated 9 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
- ☆84Updated last year
- A version of Epigram 1 that can run with newer GHCs☆55Updated 8 years ago
- MixML prototype interpreter☆27Updated 6 years ago
- Experiments with sequent calculi☆28Updated 4 years ago
- The Evolution of a Typechecker☆54Updated 7 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- The Prettiest Printer☆35Updated last year
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- Library for automatic unit testing of Standard ML modules☆71Updated 5 years ago
- System F implemented in Haskell☆24Updated 13 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 11 years ago
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Updated 8 years ago
- Logical relations proof in Agda☆27Updated 10 years ago
- Deferring the Details and Deriving Programs☆14Updated 6 years ago
- Standard ML compiler based on typed intermediate languages.☆51Updated 11 years ago
- Another implementation of Frank.☆70Updated 8 years ago
- ☆22Updated 9 years ago