JohnReppy / sml-compiler-utilsLinks
A collection of SML utility modules that are useful for compiler writing.
☆11Updated 7 months ago
Alternatives and similar repositories for sml-compiler-utils
Users that are interested in sml-compiler-utils are comparing it to the libraries listed below
Sorting:
- A Certified Interpreter for ML with Structural Polymorphism☆45Updated 8 months ago
- OCaml backend for Agda☆39Updated 7 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 8 months ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- 👹 A library for hierarchical names and lexical scoping☆26Updated 3 weeks ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- Efficient binder representation in OCaml☆43Updated last year
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 7 months ago
- multi-shot continuations in OCaml☆51Updated 3 weeks ago
- An abstract machine using indexed containers and their zippers☆13Updated 8 years ago
- flexible 'let rec' generation for MetaOCaml☆28Updated 3 months ago
- A reflection-based proof tactic for lattices in Coq☆21Updated 2 years ago
- An implementation of MacroML [Ganz, Sabry & Taha 2001]☆32Updated 6 years ago
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆104Updated 6 months ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 12 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- A standalone implementation of Ltac2 as a Coq plugin. Now part of the main Coq repository.☆32Updated 6 years ago
- Signature documentation tool for Standard ML☆14Updated 2 years ago
- MetaML and MetaOCaml bibliography☆97Updated last year
- The Evolution of a Typechecker☆54Updated 6 years ago
- A statically-typed programming language based on "F-ing modules"☆81Updated 5 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 6 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 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
- A prototype implementation of the Frank programming language☆17Updated 9 years ago
- 🦠 Reusable components based on algebraic effects☆51Updated 3 weeks ago
- A simple supercompiler formally verified in Agda☆34Updated 8 years ago