Automatic code generation for Scala functions and expressions via the Curry-Howard isomorphism
Elsa is a lambda calculus evaluator
A modern proof language
Coq formalizations of functional languages.
⛪️ Church Encoding in JS
A simple, zero-dependency implementation of the untyped lambda calculus in Safe Rust
implementation of Pure Type Systems (PTS) in Rust.
λtext - higher-order file applicator
A statically-typed strictly-evaluated garbage-collected readable programming language.
Formalisation of the linear lambda calculus in Coq
A library for functional programming in Rust
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.
An interpreter for learning and exploring pure λ-calculus
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
Write You A Haskell
Building a modern functional compiler from first principles. (http://dev.stephendiehl.com/fun/)
Fine-grain implementations of common lambda calculi in Haskell, tested with QuickCheck
Lecture note on Lambda Calculus and Types for FLOLAC
Implementation of the Fibonacci sequence in JS using pure Lambda Calculus
Abstract krivine machine implementing call-by-name semantics. In OCaml.
The compilation target that functional programmers always wanted.
lambda calculus interpreter
An Android app that provides a visual interface for creating and evaluating lambda calculus expressions
An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types
Formalization of the polymorphic lambda calculus and its parametricity theorem
Minimalistic dependent type theory with syntactic metaprogramming
A universe of scope- and type-safe syntaxes (syntices?). Includes generic implementation of type-preserving renaming/substitution with all the proofs you could possibly need.
An inference engine for extensional untyped λ-calculus
An interactive theorem prover based on lambda-tree syntax
Book: Gentle Introduction to Dependent Types with Idris
A minimalist pure lazy functional programming language
Bologna Optimal Higher-Order Machine, Version 1.1
Efficient and single-steppable ULC evaluation algorithm