algorithmw-rust | basic implementation of Hindley-Milner type inference

algorithmw-rust is a Rust library. algorithmw-rust has no bugs, it has no vulnerabilities, it has a Weak Copyleft License and it has low support. You can download it from GitHub.

CMPUT 403 Final Project Noah Weninger Winter 2016. This is an implementation of Hindley-Milner type inference via Algorithm W. Given the abstract syntax tree of some program in a format that resembles lambda calculus but extended to support various primitive types and binding of values to names, it will determine the most general type of the program. Type variables will only be instantiated whenever necessary. The complexity class is EXPTIME. Due to the complex nature of the input, it is difficult to determine more specifically how the algorithm will behave on an input. Two of the test cases demonstrate this - by changing the order of a single application it goes from producing a small type as output to an incredibly large one. This project is implemented in Rust. Under the directory src, you will see two files. w.rs contains the implementation, and main.rs contains the tests. To compile, you will need the Rust compiler, version 1.x, as well as Cargo. Cargo is usually included alongside a default Rust installation. Compiler downloads are available here: Once your build environment is set up, just do cargo run from inside this directory to compile and run the tests.