Large Scale Type Systems (programming language)
-
Updated
Jun 23, 2024 - Rust
Large Scale Type Systems (programming language)
A simple, zero-dependency implementation of the untyped lambda calculus in Safe Rust
simple SKI combinator calculus language written in rust
A dependent type checker for lambda calculus.
An implementation and tutorial for Lambda Calculus in Rust
A library for program induction and learning representations.
🦀 λ Overly-documented Rust-powered Lambda Calculus Interpreter.
A blossoming type system.
Pure untyped lambda calculus in safe Rust.
An untyped lambda calculus interpreter
A library for functional programming in Rust
Some type-level magic in some languages.
An implementation of the Typed Lambda Calculus described in https://papl.cs.brown.edu/2018/types.html
Implementation of the first-order typed lambda calculus as a CLI proof system.
This is a lambda calculus solver/reducer I wrote to better understand what it is and how it works. I choose Rust as my language of choose because it is the one I feel the most comfortable programming in.
Add a description, image, and links to the lambda-calculus topic page so that developers can more easily learn about it.
To associate your repository with the lambda-calculus topic, visit your repo's landing page and select "manage topics."