Live briefing

Everything about Church encoding

Representation of data of various types in lambda calculus

In mathematics, Church encoding is a method of representing various types of data in the lambda calculus. Wikipedia →

🧭 Start here: a 6-step reading path

No dictionary entry for this exact phrase.

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

Mogensen–Scott encoding In computer science, Scott encoding is a way to represent algebraic data types in the lambda calculus, following their syntactic definition without regard…
Lambda calculus In mathematical logic, the lambda calculus (also written as λ-calculus) is a formal system for expressing computation based on function abstraction and…
Lambda lifting Lambda lifting is a meta-process that restructures a computer program so that functions are defined independently of each other in a global scope. An individual…
Lambda calculus definition The lambda calculus is a formal mathematical system consisting of constructing lambda terms and performing reduction operations on them. The definition…
SKI combinator calculus The SKI combinator calculus is a combinatory logic system and a computational system. It can be thought of as a computer programming language, though it…
Fixed-point combinator In combinatory logic for computer science, a fixed-point combinator (or fixpoint combinator) is a higher-order function (i.e., a function that takes a…
Combinatory logic Combinatory logic is a notation to eliminate the need for quantified variables in mathematical logic. It was introduced by Moses Schönfinkel and Haskell…
System F System F (also polymorphic lambda calculus or second-order lambda calculus) is a typed lambda calculus that introduces, to simply typed lambda calculus…