JohnReppy / sml-compiler-utilsLinks
A collection of SML utility modules that are useful for compiler writing.
☆11Updated last month
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 bare-bones LCF-style proof assistant☆25Updated 6 years ago
- 👹 A library for hierarchical names and lexical scoping☆26Updated 2 months ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆45Updated 9 months ago
- Implementation of sprintf for Coq☆18Updated 5 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 10 months ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 2 weeks ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- Session types in Idris2!☆27Updated 5 years ago
- 🦠 Reusable components based on algebraic effects☆51Updated 2 months ago
- LL(1) parser generator verified in Coq☆48Updated 5 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- The Evolution of a Typechecker☆54Updated 7 years ago
- A prototype implementation of the Frank programming language☆17Updated 9 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- SML implementation of System T from PFPL.☆11Updated 8 years ago
- OCaml backend for Agda☆39Updated 7 years ago
- A reflection-based proof tactic for lattices in Coq☆21Updated 2 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Efficient binder representation in OCaml☆43Updated last year
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated 2 years ago
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆104Updated 8 months ago
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 3 years ago
- A simple supercompiler formally verified in Agda☆34Updated 8 years ago
- An abstract machine using indexed containers and their zippers☆13Updated 9 years ago
- 🩺 A library for compiler diagnostics☆52Updated 2 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- An enhanced unification algorithm for Coq☆58Updated last month