The simply typed lambda calculus is a type theory that interprets the lambda calculus with only one type constructor for function types. It was introduced by Alonzo Church in 1940 to avoid paradoxical use of the untyped lambda calculus. Extensions of the simply typed lambda calculus include products, coproducts, natural numbers, and full recursion, while systems with polymorphic or dependent types are not considered simply typed.
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