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
- Implementing the type system described in the paper "Complete and Easy Bidirectional Type Inference" in Rust☆46Updated 8 years ago
- Implicit Drop/move protection for Rust (linear types)☆12Updated 9 years ago
- ☆35Updated 6 years ago
- IODyn: A functional language for implicitly-incremental programs with dynamic input and output collections☆15Updated 7 years ago
- Normalization by evaluation for Martin-Löf Type Theory with dependent records☆98Updated 2 years ago
- A type checker for the Lean theorem prover☆41Updated 4 years ago
- The Alms Programming Language☆44Updated 6 years ago
- Fungi: Typed incremental computation with names☆67Updated 5 years ago
- Rust to F* toolchain☆42Updated 6 years ago
- type safe, concurrent, pauseless, copying, generational GC. Implementation https://github.com/Avi-D-coder/sundial-gc☆31Updated 4 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
- Collections Library for Adapton, in Rust☆13Updated 7 years ago
- Automagical variable binding library for Rust☆67Updated 5 years ago
- A simple prolog implementation in Rust☆26Updated 4 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- A functional systems programming language with compile-time memory management☆31Updated 3 years ago
- The language of the future!☆72Updated last year
- Map lazy functional language constructs to LLVM IR☆50Updated 5 years ago
- An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system☆84Updated 7 years ago
- A visual interpreter of the template instantiation machine to understand evaluation of lazy functional languages☆70Updated 8 years ago
- Higher kinded polymorphism in a language with unboxed, statically sized datatypes.☆51Updated 4 months ago
- Strict Haskell-like programming language that compiles to LLVM☆70Updated 5 years ago
- ☆23Updated 6 years ago
- café, a systems language☆19Updated 7 years ago
- Hindley-Milner type inference using constraints☆50Updated 8 years ago
- A not-yet-functional Rust parser written in LALRPOP.☆35Updated 8 years ago
- cargo +nightly build☆34Updated 5 years ago
- being an experiment with potato power☆23Updated 5 years ago
- A dependent type system built entirely in Rust's trait system (WIP).☆25Updated 6 years ago