Church Encodings

Church encoding

Church encoding is a method of representing data and operators in the lambda calculus using higher-order functions. It was first proposed by Alonzo Church and is used to represent primitive terms such as integers, booleans, pairs, lists, and tagged unions. The Church-Turing thesis states that any computable operator can be represented under Church encoding.

1 courses cover this concept

CSE 505 Programming Languages

University of Washington

Spring 2021

University of Washington's course develops rigorous tools to study the meaning of programs. It aims to improve formalism, proof skills, and precision in programming, while also discussing practical applications. It covers operational semantics, Hoare Logic, compiler correctness, and more.

No concepts data

+ 17 more concepts