Programming and Meta-Programming in Scheme (Undergraduate Texts in Computer Science) Review

Average Reviews:

(More customer reviews)Are you looking to buy Programming and Meta-Programming in Scheme (Undergraduate Texts in Computer Science)? Here is the right place to find the great deals. we can offer discounts of up to 90% on Programming and Meta-Programming in Scheme (Undergraduate Texts in Computer Science). Check out the link below:

>> Click Here to See Compare Prices and Get the Best Offers

Programming and Meta-Programming in Scheme (Undergraduate Texts in Computer Science) ReviewI highly recommend this book to help explain the mathematics and vocabulary used in the Scheme language. I recommend this book especially to those that are perplexed by the text in the book called The Little Schemer.
This book doesn't make the assumption, which The Little Schemer makes, that one understands the words used to program in Scheme.
The chapters are well organised, and shows the author to be organised in his thought processes. I can well imagine him to be a very understanding lecturer on the subject, giving thought to the probability that each student has different levels or aspects of understanding, and that nobody knows everything about any one thing.Programming and Meta-Programming in Scheme (Undergraduate Texts in Computer Science) OverviewBy now, Scheme is a well-established programming language and is finding increasing popularity in programming courses for undergraduates. Its expressive capabilities are matched by a simplicity of language and ease-of-use which have made its adherents disciples! This textbook provides a comprehensive first course in Scheme and covers all of its major features: abstraction, functional programming, data types, recursion, and semantic programming. Although the primary goal of this text is to teach students to program in Scheme, it will be suitable for any student studying a general programming principles course. Each chapter is divided into three sections: core, appendix , and problems. Most essential topics are covered in the core section, but it is assumed that most students will read the appendices and solve most of the problems. (Nearly all of the problems require students to write short Scheme procedures.) As well as providing a thorough grounding in Scheme, the author discusses in depth different programming paradigms. An important theme throughout is that of "meta-programming": the perspective that programs themselves can be treated as data, and hence can be analyzed and modified as objects. This provides insight into topics such as type-checking and overloading which might otherwise be missed.

Want to learn more information about Programming and Meta-Programming in Scheme (Undergraduate Texts in Computer Science)?

>> Click Here to See All Customer Reviews & Ratings Now

Read More...

Design Concepts in Programming Languages Review

Average Reviews:

(More customer reviews)Are you looking to buy Design Concepts in Programming Languages? Here is the right place to find the great deals. we can offer discounts of up to 90% on Design Concepts in Programming Languages. Check out the link below:

>> Click Here to See Compare Prices and Get the Best Offers

Design Concepts in Programming Languages ReviewThe book is about various concepts encountered in various kinds of programming languages: denotational and operational (BOS/SOS) semantics, issues of state and control, type systems, modules, modeling effects and compilation.
Every concept is introduced by defining the semantics of a language that has this concept and exploring the design dimensions and issues of this concept and language.
Concepts are gradually accumulated, and by the time you reach the chapter on modules you've got a CBV language with records, mutable state, polymorphic algebraic data types, a System F type system with type inference and a hint of dependent types, abstract data types and first-class dynamically loadable modules.
The tools used for description are of course the good old denotational and operational semantics and typing judgements and derivation trees; but each element of those is clearly and succintly described in text; it happens to me all the time that I am reading a type reconstruction algorithm and wondering, "why does this rule have that restriction?" and it immediately turns out that in the next paragraph, the authors focus attention on why this rule has that restriction; just like if they were reading my thoughts.
That's why this book feels very comfortable to me: I am absolutely sure that I won't encounter a point where I am lost and buried under the notation; but there is also not a single boring moment.
I've been interested in functional programming and PL theory for 2-3 years already, and here's a brief list of the *new* things that I have learned, at least:
- What do SOS and BOS mean, and why one should care, and what properties a SOS might posess (confluence and normalization, for instance)
- How many features of languages can be defined in terms of simply desugaring, and how in some cases they can't
- How one might use monadic style in the semantics metalanguage to greatly simplify the semantic rules for monadic concepts like state, control and error handling (the authors mention the word "monad" only once, but they use return- and bind-like operators in their semantics)
- How powerful records are, and of what use are operators like "conceal"
- What use is subtyping outside of OOP
- How does one define CPS-style semantics and how such a style allows to add state, control and errors with minimal changes
- How small yet powerful an OOP language core can be
- How algebraic datatypes can be very useful even in a language without static typing
- How pattern matching can be desugared into CPS-style deconstructors
- How many caveats are there in defining typing rules, and how a small change in them can lead to very big changes in language expressiveness
- How HM type inference actually works
- Why purity is important for certain polymorphism issues
- What let-polymorphism means
- What effect systems are
- How effect reconstruction works and how it is different from type reconstruction in nature
- How effect inference can prove the external purity of certain internally impure programs
That's where I finished my reading for now. The remaining looks even more intriguing; for example, I don't (yet) know how functional languages are compiled and how register allocation is done.
I'm afraid to sound like a salesman, but this is absolutely the best-written technical book I have ever seen in my life, and probably the most influential one for me, excluding maybe SICP.Design Concepts in Programming Languages OverviewKey ideas in programming language design and implementation explainedusing a simple and concise framework; a comprehensive introduction suitable for useas a textbook or a reference for researchers.

Want to learn more information about Design Concepts in Programming Languages?

>> Click Here to See All Customer Reviews & Ratings Now

Read More...