A simple, zero-dependency implementation of the untyped lambda calculus in Safe Rust

Beta reduction graph visualization

A HTML/JS web application that converts a Turing machine to an untyped lambda calculus term (and vice versa) within a polynomial time complexity.

This repository contains lab work of High Performance Computing. This course is offered at DA-IICT in 6th semester (3rd Year). The main purpose of this course is to get maximum throughput from any system. Depending upon the cache size, processor and using multi threading via open-mp, we are analyzing the performance, its efficiency, speedup, thr…

automatized generation of optimized Gillespie algorithm

A Haskell implementation of a Lambda Calculus interpreter supporting Normal and Applicative reduction strategies. Features include a powerful REPL, macro definitions, and a standard library with Church encodings for Booleans, Numerals, and Pairs. A comprehensive tool for understanding functional programming foundations.