About the Book
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 279. Chapters: Academic programming languages, Compiler construction, Dependently typed programming, Lambda calculus, Program analysis, Program transformation, Programming language semantics, Type theory, Context-free grammar, Lisp, Backus-Naur Form, Pascal, Scheme, Ordered pair, Abstract data type, Prolog, Lexical analysis, ML, Extended Backus-Naur Form, Control flow graph, Denotational semantics, CLU, Currying, Abstract syntax, Side effect, Knights of the Lambda Calculus, Static program analysis, Prototype-based programming, Combinatory logic, Referential transparency, Tuple, Fixed point combinator, Church-Rosser theorem, Uniqueness type, Dynamic recompilation, Just-in-time compilation, Tagged union, Liskov substitution principle, ALGOL 68, Control table, Curry-Howard correspondence, Type system, New Foundations, Axiom of reducibility, Anonymous function, Haskell, Name mangling, Data structure alignment, ALGOL 60, Duck typing, Binary lambda calculus, Simply typed lambda calculus, Static single assignment form, Aspect weaver, Covariance and contravariance, Variable, Subtype polymorphism, Type safety, First-class function, Enumerated type, Parsing, Type inference, Intuitionistic type theory, Algebraic data type, Church encoding, Dependent type, System F, Call graph, SKI combinator calculus, Name resolution, Normalisation by evaluation, Operational semantics, De Bruijn index, Type class, Strong typing, Type conversion, Compiler Description Language, Loop dependence analysis, Funarg problem, Apply, Semantics of programming languages, Van Wijngaarden grammar, Initial algebra, Aliasing, Higher-order function, Parametric polymorphism, Use-define chain, Lookahead, Kind, Higher-order abstract syntax, Unit type, Ad-hoc polymorphism, Brouwer-Heyting-Kolmogorov interpretation, Calculus of constructions, Structural type system, Programming ...
