AndyShiue / ptsLinks
implementation of Pure Type Systems (PTS) in Rust.
☆52Updated 8 years ago
Alternatives and similar repositories for pts
Users that are interested in pts are comparing it to the libraries listed below
Sorting:
- Abstract binding tree code generator☆37Updated 8 years ago
- Rust to F* toolchain☆42Updated 6 years ago
- Implementing the type system described in the paper "Complete and Easy Bidirectional Type Inference" in Rust☆46Updated 9 years ago
- ☆35Updated 6 years ago
- Automagical variable binding library for Rust☆67Updated 5 years ago
- A visual interpreter of the template instantiation machine to understand evaluation of lazy functional languages☆70Updated 8 years ago
- A type checker for the Lean theorem prover☆41Updated 4 years ago
- Fungi: Typed incremental computation with names☆69Updated 5 years ago
- Implicit Drop/move protection for Rust (linear types)☆12Updated 10 years ago
- Normalization by evaluation for Martin-Löf Type Theory with dependent records☆98Updated 3 years ago
- ☆23Updated 6 years ago
- café, a systems language☆19Updated 7 years ago
- A not-yet-functional Rust parser written in LALRPOP.☆35Updated 8 years ago
- IODyn: A functional language for implicitly-incremental programs with dynamic input and output collections☆15Updated 7 years ago
- Rust implementation of prolog based on miniprolog: http://andrej.com/plzoo/html/miniprolog.html☆82Updated 4 years ago
- OCaml runtime and FFI bindings directly in Rust☆79Updated 8 years ago
- Typed λ-calculus in Rust☆29Updated 2 years ago
- The language of the future!☆72Updated last year
- A macro for defining type operators in Rust.☆64Updated 8 years ago
- A Redex Model of Rust, or more specifically an encoding of Patina, the formal model for rust's type safety☆24Updated 10 years ago
- Implementation of "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism"☆112Updated 6 years ago
- Generate Purescript types from your Rust types. (unmaintained)