Building a modern functional compiler from first principles. (http://dev.stephendiehl.com/fun/)
-
Updated
Jan 11, 2021 - Haskell
Building a modern functional compiler from first principles. (http://dev.stephendiehl.com/fun/)
A modern proof language
Canonical sources for HOL4 theorem-proving system. Branch develop is where “mainline development” occurs; when develop passes our regression tests, master is merged forward to catch up.
A library for functional programming in Rust
A Flock of Functions: Combinators, Lambda Calculus, & Church Encodings in JS
🔮 Estudos obscuros de programação funcional
十分钟魔法练习
Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations
Elsa is a lambda calculus evaluator
An interactive theorem prover based on lambda-tree syntax
An interpreter for learning and exploring pure λ-calculus
Automatic code generation for Scala functions and expressions via the Curry-Howard isomorphism
x86 C compiler written in untyped lambda calculus
A curated list of functional programming resources to study the fp paradigm
Life like molecular computers with artificial chemistry.
Make a lambda calculus.
A human readable quasi-concatenative programming language
Specification of the Formality proof and programming language
🐦 Some combinators
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."