Alonzo Church was born on June 14, 1903, in Washington, D.C., where his father, Samuel Robbins Church, was the judge of the Municipal Court for the District of Columbia. The family later moved to Virginia after his father lost this position because of failing eyesight. With help from his uncle, also named Alonzo Church, he was able to attend the Ridgefield School for Boys in Ridgefield, Connecticut. After graduating from Ridgefield in 1920, Church attended Princeton University where he was an exceptional student, publishing his first paper, on Lorentz transformations, and graduating in 1924 with a degree in mathematics. He stayed at Princeton, earning a Ph.D. in mathematics in three years under Oswald Veblen.

He married Mary Julia Kuczinski in 1925 and the couple had three children, Alonzo Church, Jr. (1929), Mary Ann (1933) and Mildred (1938).

After receiving his Ph.D. he taught briefly as an instructor at the University of Chicago and then received a two-year National Research Fellowship. This allowed him to attend Harvard University in 1927–1928 and then both University of Göttingen and University of Amsterdam the following year. He taught philosophy and mathematics at Princeton, 1929–1967, and at the University of California, Los Angeles, 1967–1990. He was a Plenary Speaker at the ICM in 1962 in Stockholm. He received honorary Doctor of Science degrees from Case Western Reserve University in 1969, Princeton University in 1985, and the University at Buffalo, The State University of New York in 1990 in connection with an international symposium in his honor organized by John Corcoran.

A deeply religious person, he was a lifelong member of the Presbyterian church.

He died in 1995 and was buried in Princeton Cemetery.

Church is known for the following accomplishments:

His proof that the Entscheidungsproblem, which asks for a decision procedure to determine the truth of arbitrary propositions in a first-order mathematical theory, is undecidable. This is known as Church's theorem.
His proof that Peano arithmetic is undecidable.
His articulation of what has come to be known as the Church–Turing thesis.
He was the founding editor of the *Journal of Symbolic Logic*, editing its reviews section until 1979.
His creation of the lambda calculus.
The lambda calculus emerged in his 1936 paper showing the unsolvability of the Entscheidungsproblem. This result preceded Alan Turing's work on the halting problem, which also demonstrated the existence of a problem unsolvable by mechanical means. Church and Turing then showed that the lambda calculus and the Turing machine used in Turing's halting problem were equivalent in capabilities, and subsequently demonstrated a variety of alternative "mechanical processes for computation." This resulted in the Church–Turing thesis.

The efforts for automatically generating a controller implementation from specifications originates from his ideas.

The lambda calculus influenced the design of the LISP programming language and functional programming languages in general. The Church encoding is named in his honor.

Many of Church's doctoral students have led distinguished careers, including C. Anthony Anderson, Peter B. Andrews, George A. Barnard, David Berlinski, William W. Boone, Martin Davis, Alfred L. Foster, Leon Henkin, John G. Kemeny, Stephen C. Kleene, Simon B. Kochen, Maurice L'Abbé, Isaac Malitz, Gary R. Mar, Michael O. Rabin, Nicholas Rescher, Hartley Rogers, Jr., J. Barkley Rosser, Dana Scott, Raymond Smullyan, and Alan Turing. A more complete list of Church's students is available via Mathematics Genealogy Project.

Alonzo Church, *Introduction to Mathematical Logic* (ISBN 978-0-691-02906-1)
Alonzo Church, *The Calculi of Lambda-Conversion* (ISBN 978-0-691-08394-0)
Alonzo Church, *A Bibliography of Symbolic Logic, 1666–1935* (ISBN 978-0-8218-0084-3)
C. Anthony Anderson and Michael Zelëny, (eds.), *Logic, Meaning and Computation: Essays in Memory of Alonzo Church* (ISBN 978-1-4020-0141-3)