michiakig / maml
(the first half of) an ML compiler
☆10Updated 10 years ago
Alternatives and similar repositories for maml
Users that are interested in maml are comparing it to the libraries listed below
Sorting:
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- Signature documentation tool for Standard ML☆14Updated last year
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆28Updated last week
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 7 years ago
- being the beginnings of at least zero typecheckers☆33Updated 8 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- System F in coq.☆19Updated 10 years ago
- Tool for detecting bad style in Standard ML programs☆16Updated 6 years ago
- IO using sized types and copatterns☆34Updated 4 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- being bits and pieces I'm inclined to leave lying around☆50Updated 5 months ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated last year
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 2 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Updated 7 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated last month
- ☆11Updated 4 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 7 years ago
- An implementation of (some fragment of) cubical type theory using rewrite rules, based on a talk given by Conor McBride at the 23rd Agda'…☆12Updated 8 years ago
- Formalizing nbe in agda☆30Updated 12 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- A collection of SML utility modules that are useful for compiler writing.☆11Updated 2 weeks ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago