Programming Languages: Application and Interpretation
by Shriram Krishnamurthi
Publisher: Lulu.com 2007
ISBN/ASIN: B00262R7B0
Number of pages: 376
Description:
The book is the textbook for the programming languages course at Brown University, which is taken primarily by third and fourth year undergraduates and beginning graduate (both MS and PhD) students. It seems very accessible to smart second year students too, and indeed those are some of my most successful students. The book has been used at over a dozen other universities as a primary or secondary text. The book’s material is worth one undergraduate course worth of credit. The author wants to show students where languages come from, why we should regard languages as the ultimate form of abstraction, how to recognize such an evolving abstraction, and how to turn what they recognize into a language.
Download or read it online for free here:
Download link
(1.3MB, PDF)
Similar books
Semantics: Advances in Theories and Mathematical Modelsby Muhammad Tanvir Afzal (ed.) - InTech
The book is a blend of a number of great ideas, theories, mathematical models, and practical systems in the domain of Semantics. Topics include: Background; Queries, Predicates, and Semantic Cache; Algorithms and Logic Programming; etc.
(12097 views)
Elements of Programmingby Alexander Stepanov, Paul McJones - Semigroup Press
This book applies the deductive method to programming by affiliating programs with the abstract mathematical theories. Specification of these theories, algorithms and theorems and lemmas describing their properties are presented together.
(8966 views)
A Practical Theory of Programmingby Eric C.R. Hehner - Springer
Understanding programming languages requires knowledge of the underlying theoretical model. This book explores aspects of programming that are amenable to mathematical proof. It describes a simple and comprehensive theory.
(17234 views)
The Theory of Languages and Computationby Jean Gallier, Andrew Hicks - University of Pennsylvania
From the table of contents: Automata; Formal Languages (A Grammar for Parsing English, Context-Free Grammars, Derivations and Context-Free Languages, Normal Forms for Context-Free Grammars, Chomsky Normal Form, ...); Computability; Current Topics.
(11693 views)