About the Book
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 98. Chapters: Ordered pair, Abstract data type, Prototype-based programming, Tuple, Uniqueness type, Tagged union, Liskov substitution principle, Curry-Howard correspondence, Type system, New Foundations, Axiom of reducibility, Duck typing, Covariance and contravariance, Variable, Subtype polymorphism, Type safety, Enumerated type, Type inference, Intuitionistic type theory, Algebraic data type, Dependent type, System F, Type class, Strong typing, Type conversion, Initial algebra, Parametric polymorphism, Kind, Higher-order abstract syntax, Unit type, Ad-hoc polymorphism, Calculus of constructions, Structural type system, Abstract type, Twelf, Bottom type, Pure type system, Composite data type, Value, Recursive data type, Typed lambda calculus, Top type, Nullable type, Void type, Open/closed principle, Effect system, Setoid, Lambda cube, Mathematical structure, Option type, Nominative type system, Container, Type signature, Product type, Parametricity, Weak typing, Trait, Reference type, Signedness, Type constructor, Linear type system, Automath, Manifest typing, Generalized algebraic data type, Type inhabitation, Static cast, Traits class, Type erasure, Attribute domain, Typeful programming, System F-sub, Type soundness, Calculus of inductive constructions, Principal type, Universal type, Nominative and structural type systems, Derived type. Excerpt: The Curry-Howard correspondence is the direct relationship between computer programs and proofs in programming language theory and proof theory. Also known as Curry-Howard isomorphism, proofs-as-programs correspondence and formulae-as-types correspondence, it is a generalization of a syntactic analogy between systems of formal logic and computational calculi that was first discovered by the American mathematician Haskell Curry and logician William Alvin Howard. At the very beginning...
