lqd / a-mir-formality

a PLT redex model of MIR and its type system

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

a-mir-formality

This repository is an early-stage experimental project that aims to be a complete, authoritative formal model of the Rust MIR. Presuming these experiments bear fruit, the intention is to bring this model into Rust as an RFC and develop it as an official part of the language definition.

Quickstart guide

The quickstart guide can be found in the documentation

Tool

For the time being, the model is implemented in PLT Redex. PLT Redex was chosen because it is ridiculously accessible and fun to use. It lets you write down type system rules and operational semantics and then execute them, using a notation that is very similar to what is commonly used in published papers. You can also write collections of unit tests and fuzz your model by generating test programs automatically.

The hope is that PLT Redex will prove to be a sufficiently accessible tool that many Rust contributors will be able to understand, play with, and extend the model.

One downside of PLT Redex is that it doesn't scale naturally to performing proofs. We may choose to port the model to another system at some point, or maintain multiple variants.

About

a PLT redex model of MIR and its type system

License:Apache License 2.0


Languages

Language:Racket 91.3%Language:Rust 7.7%Language:Python 0.7%Language:Shell 0.3%Language:Nix 0.0%