by Keijo Ruohonen
Publisher: Tampere University of Technology 2009
Number of pages: 98
In these lecture notes the classical Chomskian formal language theory is fairly fully dealt with, omitting however much of automata constructs and computability issues. In addition, surveys of Lindenmayer system theory and the mathematical theory of codes are given.
Home page url
Download or read it online for free here:
by Doug Hoyte - Lulu.com
One of the most hardcore computer programming books out there. Starting with the fundamentals, it describes the most advanced features of the most advanced language: Common Lisp. This book is about macros, that is programs that write programs.
by Simon Peyton Jones, David Lester - Prentice Hall
This book gives a practical approach to understanding implementations of non-strict functional languages using lazy graph reduction. It is intended to be a source of practical material, to help make functional-language implementations come alive.
by Peter Selinger - Dalhousie University
Topics covered in these notes include the untyped lambda calculus, the Church-Rosser theorem, combinatory algebras, the simply-typed lambda calculus, the Curry-Howard isomorphism, weak and strong normalization, type inference, etc.
by Krysia Broda et al - Prentice Hall Trade
The text for advanced undergraduate/graduate students of computer science. It introduces functional, imperative and logic programming and explains how to do it correctly. Functional programming is presented as a programming language in its own right.