User:K Smeltz/Books/To Make a Mockingbird

Lambda calculus = combinatory logic = formal proof = every algorithm

 * The Chase
 * B,C,K,W system
 * Combinatory logic
 * Curry's paradox
 * Curry–Howard correspondence
 * Deduction theorem
 * Fixed-point combinator
 * Frege's propositional calculus
 * Hilbert system
 * Idempotency of entailment
 * Implicational propositional calculus
 * Intuitionistic logic
 * Iota and Jot
 * List of logic systems
 * Peirce's law
 * Propositional calculus
 * Rule of inference
 * SKI combinator calculus
 * Łukasiewicz logic


 * Theory
 * Affine logic
 * Algorithmic information theory
 * Berry paradox
 * Church encoding
 * Church–Rosser theorem
 * Coinduction
 * Correctness (computer science)
 * Decidability (logic)
 * Dependent type
 * Gödel numbering
 * Gödel, Escher, Bach
 * Kappa calculus
 * Kolmogorov complexity
 * Lambda calculus
 * Lambda cube
 * Lambda-mu calculus
 * Law of excluded middle
 * Linear logic
 * Logic in computer science
 * Monotonicity of entailment
 * Natural deduction
 * Pure type system
 * Richard's paradox
 * Self-verifying theories
 * Sequent
 * Sequent calculus
 * Simply typed lambda calculus
 * Strict logic
 * Structural rule
 * Substructural logic
 * Turing completeness


 * Implemented Languages
 * Agda (programming language)
 * ALF (proof assistant)
 * Automated proof checking
 * Automated theorem proving
 * Automath
 * Binary combinatory logic
 * Binary lambda calculus
 * BlooP and FlooP
 * Calculus of constructions
 * Cayenne (programming language)
 * Charity (programming language)
 * Computer-assisted proof
 * Coq
 * Corecursion
 * Epigram (programming language)
 * Formal methods
 * Formal specification
 * Formal verification
 * Hoare logic
 * HOL (proof assistant)
 * HOL Light
 * Isabelle (proof assistant)
 * Logic for Computable Functions
 * Mizar system
 * Nice (programming language)
 * Program derivation
 * Programming Computable Functions
 * Proof assistant
 * Racket (programming language)
 * Specification language
 * Substructural type system
 * System F
 * Total functional programming
 * Twelf
 * Type theory
 * Typed lambda calculus
 * Unlambda
 * Vala (programming language)


 * Practical Progress
 * Clojure
 * CompCert
 * Design by contract
 * Evaluation strategy
 * Lazy evaluation
 * Metamath
 * Proof-carrying code
 * Test-driven development
 * Z notation